By Topic

Interleaving based variable ordering methods for ordered binary decision diagrams

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

3 Author(s)
Fujii, H. ; Toshiba Corp., Kawasaki, Japan ; Ootomo, G. ; Hori, C.

Ordered binary decision diagrams (OBDDs) are efficient representations of Boolean functions and have been widely used in various computer-aided design tools. Since the size of an OBDD depends on variable ordering, it is important to find a good variable order for the efficient manipulation of OBDDs. In particular, it is important to find the same good variable order for multiple functions, since multiple functions are handled at the same time in most computer-aided design tools. The paper describes new variable ordering algorithms for multiple output circuits. The new algorithms use variable interleaving, while conventional algorithms use variable appending. For some benchmark circuits, OBDDs have been successfully generated by using the new algorithms, while they have not been generated by using conventional algorithms. Consequently, the new variable ordering algorithms are effective and allow us to apply OBDD-based CAD tools to wider classes of circuits.

Published in:

Computer-Aided Design, 1993. ICCAD-93. Digest of Technical Papers., 1993 IEEE/ACM International Conference on

Date of Conference:

7-11 Nov. 1993