By Topic

Recent advances in BDD based representations for Boolean functions: a survey

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

1 Author(s)
Narayan, A. ; Monterey Design Syst., Sunnyvale, CA, USA

ROBDDs are frequently used as the representation of choice to solve various CAD problems such as synthesis, digital-system verification and testing. However, the size of an ROBDD for a function can be exponential in the number of independent variables of the function. This so called “memory explosion problem” limits the applicability of ROBDD based algorithms and has been the locus of intense research over the past several years. Recently, some new techniques have been proposed which have significantly extended the frontiers of ROBDD based methods. This paper surveys some of these recent advances in this area and discusses their merits and shortcomings

Published in:

VLSI Design, 1999. Proceedings. Twelfth International Conference On

Date of Conference:

7-10 Jan 1999