Abstract
Methods already exist for the construction of critical race-free assignments for asynchronous sequential circuits. Some of these methods permit the construction of many assignments for the same flow table. The algorithm presented here consists of two easy to apply tests which select that critical race-free assignment most likely to produce a set of simple next-state equations. The algorithm has been programmed. Copyright © 1970 by The Institute of Electrical and Electronics Engineers, Inc.
Recommended Citation
G. K. Maki and J. H. Tracey, "State Assignment Selection In Asynchronous Sequential Circuits," IEEE Transactions on Computers, vol. C thru 19, no. 7, pp. 641 - 644, Institute of Electrical and Electronics Engineers, Jan 1970.
The definitive version is available at https://doi.org/10.1109/T-C.1970.222996
Department(s)
Electrical and Computer Engineering
Keywords and Phrases
Asynchronous sequential circuits; sequential circuit synthesis; sequential machines; state assignment
International Standard Serial Number (ISSN)
0018-9340
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Jan 1970
