By Topic

Genetic algorithm based variable ordering of BDDs for multi-level logic optimization with area-power trade-offs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chaudhury, S. ; Dept. of Electr. Eng., Nat. Inst. of Technol., Silchar, India ; Dutta, A.

Boolean logics when implemented as BDDs can be graphically manipulated to reduce the number of nodes and hence the area. Ordering of BDD nodes play a significant role in this context. Most of the algorithms for input variable ordering for OBDD focus primarily on area minimization. However, suitable input variable ordering helps in minimizing the power consumption also. In this particular work, we have adopted a genetic algorithm based technique to find an optimal input variable order, while node reordering is taken care by the standard BDD package. Experimental results show a substantial saving in area and power. We have also compared our technique with other standard methods of variable ordering for OBDDs and found to produce superior results.

Published in:

Electronics, Circuits, and Systems (ICECS), 2010 17th IEEE International Conference on

Date of Conference:

12-15 Dec. 2010