# Algorithmic Reduction And Optimization Of Logic Circuit In Area And Power Tradeoffs’ With The Help Of Binary Decision Diagram

@article{Kaur2013AlgorithmicRA, title={Algorithmic Reduction And Optimization Of Logic Circuit In Area And Power Tradeoffs’ With The Help Of Binary Decision Diagram}, author={Sukhmanjeet Kaur and M. Bansal}, journal={International journal of engineering research and technology}, year={2013}, volume={2} }

This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional explicit solving algorithms. Boolean functions can be graphically manipulated to reduce the number of nodes, hence the area, when implemented as Binary decision diagrams. So here, ordering of BDD nodes plays a very important role. Most of the algorithms for variable ordering of OBDD have focus on area minimization. Hence, for minimizing the power consumption… Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

Algorithmic Optimization of BDDs and Performance Evaluation for Multi-level Logic Circuits with Area and Power Trade-offs

- Computer Science
- Circuits Syst.
- 2011

This work has proposed two algorithms namely, a genetic algorithm based technique and a branch and bound algorithm to find an optimal input variable order for OBDDs and compared their techniques with other state-of-art techniques for variable ordering and found to give superior results. Expand

Minimization of BDDs by Evolutionary Algorithms

- Mathematics
- 1997

We present two approaches for minimization of ordered Binary Decision Diagrams (BDDs) based on Evolutionary Algorithms (EAs). We consider completely and incompletely speciied Boolean Functions (BFs).… Expand

Interleaving based variable ordering methods for ordered binary decision diagrams

- Computer Science
- ICCAD
- 1993

The new variable ordering algorithms are effective and allow us to apply OBDD-based CAD tools to wider classes of circuits and have been successfully generated by using the new algorithms. Expand

Dynamic variable ordering for ordered binary decision diagrams

- Computer Science
- ICCAD
- 1993

This paper proposes a solution to problems based on having the OBDD package itself determine and maintain the variable order by periodically applying a minimization algorithm to reorder the variables of the O BDD to reduce its size. Expand

Logic verification using binary decision diagrams in a logic synthesis environment

- Mathematics, Computer Science
- [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers
- 1988

The results of a formal logic verification system implemented as part of the multilevel logic synthesis system MIS are discussed and it has been possible to carry out formal verification for a larger set of networks than with existing verification systems. Expand

Variable ordering algorithms for ordered binary decision diagrams and their evaluation

- Mathematics, Computer Science
- IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
- 1993

The results of experiments in variable ordering using an experimentally practical algorithm are presented, which is basically a depth-first traversal through a circuit from the output to the inputs. Expand

Binary Decision Diagrams: An Improved Variable Ordering using Graph Representation of Boolean Functions

- Computer Science
- 2008

This paper presents an improved variable ordering method to obtain the minimum number of nodes in Reduced Ordered Binary Decision Diagrams (ROBDD). The proposed method uses the graph topology to find… Expand

BDD minimization by scatter search

- Mathematics, Computer Science
- IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
- 2002

The authors study the BDD minimization problem based on scatter search optimization, finding that scatter search offers a reasonable compromise between quality (BDD reduction) and time. Expand

Minimization of binary decision diagrams based on exchanges of variables

- Computer Science, Mathematics
- 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers
- 1991

The authors succeeded in minimizing a 17-variable function by the use of the BDD representation of intermediate functions and the introduction of pruning by a novel exact algorithm and gradual improvement methods for minimizing binary decision diagrams. Expand

Optimizing Variable Ordering of BDDs with Double Hybridized Embryonic Genetic Algorithm

- Computer Science
- 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
- 2010

A new double hybridized genetic algorithm for optimizing the variable order in Reduced Ordered Binary Decision Diagrams is presented, which adopts embryonic chromosomes as prefixes of variable orders instead of complete variable orders and combines a branch & bound technique with the basic genetic algorithm. Expand