This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Augmented Parity Check Codes for Encoding of Asynchronous Sequential Machines
October 1973 (vol. 22 no. 10)
pp. 891-896
R.S. Kashef, Department of Electrical Engineering, University of Southern California
Critical races can be avoided in the binary encoding of asynchronous sequential machines by making use of general codes employing-multistep changes in secondary variables to accomplish transitions between states. The shortest length code of this type presently available is Huffman's internmeshed row set code, which encodes race-free any 2SO-row flow table with 2So-1 bits. In
Index Terms:
Asynchronous sequential machines, augmented parity check codes, general race-free codes, maximum distance partition.
Citation:
R.S. Kashef, R.B. McGhee, "Augmented Parity Check Codes for Encoding of Asynchronous Sequential Machines," IEEE Transactions on Computers, vol. 22, no. 10, pp. 891-896, Oct. 1973, doi:10.1109/T-C.1973.223614
Usage of this product signifies your acceptance of the Terms of Use.