By Topic

Sequential logic optimization based on state space decomposition

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)
H. Cho ; Dept. of Electr. & Comput. Eng., Univ. of Colorado, Boulder, CO, USA ; F. Somenzi

Binary decision diagrams (BDDs) and implicit state enumeration have provided remarkable improvements to sequential logic synthesis, testing, and verification in recent years. However, their inability to deal with large circuits has been the major limitation of the methods based on them. A method to compute a subset of unreachable states using implicit state enumeration, which can be applied to large circuits where the current exact methods fail is presented. Since it is guaranteed that the computed unreachable state set is contained in the exact unreachable state set, this set can be used as invalid state don't cares in sequential logic optimization. Traversal and optimization results on benchmark examples are 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