Friday, 10 Jul, 2020

+91-9899775880

+91-9212715375

011-47044510

An Algorithm for the Construction of Decision Diagram by Eliminating, Merging and Rearranging the Input Cube Set

International Journal of System and Software Engineering

Volume 1 Issue 1

Published: 2013
Author(s) Name: Manjunath Managuli, Yogeshkumar M. H. | Author(s) Affiliation: Asst. Prof., Department of CSE, Vijaya Vittal Institute of Technology, Bangalore, Karnataka, India
Locked Subscribed Available for All

Abstract

This proposed work is Decision Diagrams are a data structure that allows compact representation of discrete functions Boolean functions. The construction of DDS in terms of memory and time is considered as problems .we proposed method of eliminating, merging and reordering the set of cubes in matrix specification that results in the reduction of both memories occupied and time complexities of the construction of DDs. First we employ elimination algorithm followed by merging and then again elimination algorithm and reordering the set of cubes .In this way, the number of operations on the nodes is reduced. This reduction results in a decrease both in the number of temporary nodes and construction time the experiments show that the total number of created nodes is reduced on an average by 35% and construction time is decreased by 49%.

Keywords: Cubes, Decision Diagram

View PDF

Refund policy | Privacy policy | Copyright Information | Contact Us | Feedback © Publishingindia.com, All rights reserved