Cart (Loading....) | Create Account
Close category search window
 

A synthesis procedure for large-scale asynchronous finite 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
$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)
Kang, J.-W. ; Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA ; Chin-Long Wey ; Fisher, P.D.

This paper presents an efficient synthesis procedure for asynchronous finite state machines (FSMs). A merged flow table is first generated from a behavioral description of a FSM. Based on the bipartite characteristics of the adjacency diagram, a race-free state assignment algorithm using bipartite graphs is applied. Several MCNC FSM benchmarks have been tested. Results show that the presented procedure can handle reasonably large asynchronous FSMs

Published in:

Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on

Date of Conference:

16-18 Aug 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.