Corpus ID: 85561522

Low Power Optimization Technique and a genetic minimization algorithm for variable ordering of BDD mapped VLSI Circuits

  title={Low Power Optimization Technique and a genetic minimization algorithm for variable ordering of BDD mapped VLSI Circuits},
  author={M. Bansal and A. Agarwal},
Ordered binary decision diagrams (BDDs) yield a data structure for switching functions that has been proven to be very useful in sloving many of the problems in VLSI CAD. BDDbased calculations is the variable ordering problem which addresses the major problem of finding an ordering of the input variables which minimizes the size of the BDD-representation. In this paper, the use of genetic algorithms to improve the variable ordering of a given BDD is implemented and experimental studies are… Expand

Figures and Tables from this paper


Algorithmic Optimization of BDDs and Performance Evaluation for Multi-level Logic Circuits with Area and Power Trade-offs
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
Binary Decision Diagrams: An Improved Variable Ordering using Graph Representation of Boolean Functions
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 findExpand
Low power optimization technique for BDD mapped circuits
A technique for minimizing the overall sum of switching probabilities is presented and the resulting circuit that is obtained by mapping the BDD to CMOS Pass Transistors has in simulation using a commercially available process model) shown reduced power dissipation characteristic. Expand
BDD minimization by scatter search
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
Improved variable ordering of BDDs with novel genetic algorithm
  • N. Zhuang, M. Benten, P. Cheung
  • Mathematics
  • 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96
  • 1996
A new algorithm for variable ordering of binary decision diagram (BDD) is presented. The algorithm is based on a novel formulation of the Genetic Algorithm (GA) employing three dynamic GA parameters:Expand
Binary Decision Diagram (BDD)
This paper has a review on applications of BDD and it’s variants to solving some problems, and introduces B DD and its variants OBDD and ROBDD (Reduced Ordered Binary Decision Diagram). Expand
MORE: an alternative implementation of BDD packages by multi-operand synthesis
  • A. Hett, B. Becker, R. Drechsler
  • Computer Science
  • Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition
  • 1996
In this paper we present a new approach for the realization of a BDD package. This approach does not depend on recursive synthesis operations, i.e. the ternary If-Then-Else-operator (ITE), to performExpand
A consumer report on BDD packages
  • G. Janssen
  • Computer Science
  • 16th Symposium on Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings.
  • 2003
It is argued that there is a substantial spectrum in quality as measured by various metrics and it is found that even the better packages do not always deploy the latest technology. Expand
Roopchand Jidge, " Heuristic Approach to Variable Ordering for Logic Synthesis Engine Design:Algorithmic Insight.
  • International Journal of Circuits and Architectural Design,Vol
  • 2014