This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
R.J. Smith, Department of Electrical Engineering and Computer Science, Southern Methodist University
Several algorithms have been proposed for generating satisfactory state assignments for normal fundamental mode asynchronous sequential circuits. Programmed versions of minimal and near-minimal techniques have been incorporated in automated synthesis systems, but are known to require computational efforts which increase exponentially with flow table size. Other methods, requiring much less effort, produce assignments with far more state variables than minimal assigments.
Index Terms:
Asynchronous sequential circuits, design automation heuristics, state assigmnents.
Citation:
R.J. Smith, "Generation of Internal State Assignments for Large Asynchronous Sequential Machines," IEEE Transactions on Computers, vol. 23, no. 9, pp. 924-932, Sept. 1974, doi:10.1109/T-C.1974.224056
Usage of this product signifies your acceptance of the Terms of Use.