By Topic

Algorithms for the optimal state assignment of asynchronous state machines

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

3 Author(s)
R. M. Fuhrer ; Dept. of Comput. Sci., Columbia Univ., New York, NY, USA ; B. Lin ; S. M. Nowick

This paper presents a method for the optimal state assignment of asynchronous state machines. Unlike state assignment for synchronous state machines, state codes must be chosen carefully to ensure the avoidance of critical races and logic hazards. Two related problems are considered: (i) optimal critical race-free state assignment; and (ii) optimal hazard-free and critical race-free state assignment for normal fundamental mode machines. Analogous to a paradigm successfully used for the optimal state assignment of synchronous machines each problem is formulated as an input encoding problem. Solutions are targeted to sum-of-products implementations. Initial results indicate output logic improvements up to 20% for the hazard-free algorithm, and more modest improvement for the optimal critical race-free algorithm

Published in:

Advanced Research in VLSI, 1995. Proceedings., Sixteenth Conference on

Date of Conference:

27-29 Mar 1995