By Topic

Input order for ROBDDs based on kernel analysis

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
$31 $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

5 Author(s)
Besson, T. ; Inst. Nat. Polytech. de Grenobl ; Bouzouzou, H. ; Floricica, I. ; Saucier, G.
more authors

A method for finding a good input order for the ROBDD representation of Boolean functions for synthesis purposes is presented. This method relies on the analysis of the set of kernels of the functions. To each cokernel/kernel pair is associated a partitioning of the variables and the final order is deduced by intersecting these partitioning requirements. Results on a large set of benchmarks in the synthesis field is provided

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993