loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th Conference on Advanced Research in VLSI (ARVLSI'95)
Algorithms for the optimal state assignment of asynchronous state machines
Chapel Hill, North Carolina
March 27-March 29
ISBN: 0-8186-7047-9
ASCII Text
x 
 
R.M. Fuhrer, B. Lin, S.M. Nowick, "Algorithms for the optimal state assignment of asynchronous state machines," Advanced Research in VLSI, Conference on, pp. 59, 16th Conference on Advanced Research in VLSI (ARVLSI'95), 1995.
 
 
BibTex
x
 
@article{ 10.1109/ARVLSI.1995.515611,
author = {R.M. Fuhrer and B. Lin and S.M. Nowick},
title = {Algorithms for the optimal state assignment of asynchronous state machines},
journal ={Advanced Research in VLSI, Conference on},
volume = {0},
year = {1995},
isbn = {0-8186-7047-9},
pages = {59},
doi = {http://doi.ieeecomputersociety.org/10.1109/ARVLSI.1995.515611},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Research in VLSI, Conference on
TI - Algorithms for the optimal state assignment of asynchronous state machines
SN - 0-8186-7047-9
SP
EP
A1 - R.M. Fuhrer,
A1 - B. Lin,
A1 - S.M. Nowick,
PY - 1995
KW - asynchronous circuits; finite state machines; asynchronous sequential logic; state assignment; hazards and race conditions; minimisation of switching nets; optimal state assignment; asynchronous state machines; state codes; race-free state assignment; hazard-free state assignment; input encoding problem; sum-of-products implementations
VL - 0
JA - Advanced Research in VLSI, Conference on
ER -
 
R.M. Fuhrer, Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
B. Lin, Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
S.M. Nowick, Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
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.
Index Terms:
asynchronous circuits; finite state machines; asynchronous sequential logic; state assignment; hazards and race conditions; minimisation of switching nets; optimal state assignment; asynchronous state machines; state codes; race-free state assignment; hazard-free state assignment; input encoding problem; sum-of-products implementations
Citation:
R.M. Fuhrer, B. Lin, S.M. Nowick, "Algorithms for the optimal state assignment of asynchronous state machines," arvlsi, pp.59, 16th Conference on Advanced Research in VLSI (ARVLSI'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.