Close category search window
 

Improved state assignment for burst mode 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

2 Author(s)
Rutten, J.W.J.M. ; Inf. & Commun. Syst. Group, Eindhoven Univ. of Technol., Netherlands ; Berkelaar, M.R.C.M.

This paper addresses the problem of state assignment for Asynchronous Burst Mode Finite State Machines (ABM-FSMs). We compare an encoding scheme proposed by Fuhrer with the well known Tracey method. We then propose two improvements on Fuhrer's method which dramatically reduce the number of state variables necessary. We also prove the correctness of the instantiated machines. All results mentioned have been verified by a verification method proposed by Kung

Published in:
Advanced Research in Asynchronous Circuits and Systems, 1997. Proceedings., Third International Symposium on

Date of Conference: 7-10 Apr 1997

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.