This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Race-Free State Assignments for Synthesizing Large-Scale Asynchronous Sequential Logic Circuits
September 1993 (vol. 42 no. 9)
pp. 1025-1034

A state assignment technique is introduced for synthesizing large-scale asynchronous sequential logic circuits (ASLCs). It provides a systematic and efficient approach for generating race-free state assignments. A race condition is classified as being either an intrinsic race (IR) or or a generated race. Intrinsic races decompose into two subclassifications: visible intrinsic races and hidden intrinsic races. Algorithms have been developed to identify and eliminate these races. A graph, referred to as a Node-Weight Diagram, facilitates the process of making state assignments and guarantees that no races are generated. Moreover, it provides a convenient and efficient method for investigating the implications of selecting from an allowed set of alternative race-free state assignments. The state assignment technique described adds cycles and states, as needed, to avoid IRs and always attempts to use the minimum or near-minimum number of state variables and states. This technique has been implemented and incorporated into an ASLC design automation system. Experimental results show that it provides significantly better results than other approaches in terms of the computation time required to make the assignments and the number of state variables required to achieve race-free ASLCs.

[1] E. J. McCluskey,Logical Design Principles. Englewood Cliffs, NJ: Prenctice-Hall, 1986.
[2] D. A. Huffman, "The synthesis of sequential switching circuits,"J. Franklin Inst., vol. 257, pp. 161-190, Mar. 1954, and pp. 275-303, Apr. 1954.
[3] J. H. Tracey, "Internal state assignments for asynchronous sequential machines,"IEEE Trans. Electron. Comput., vol. EC-15, pp. 551-560, Aug. 1966.
[4] C. J. Tan, "State assignments for asynchronous sequential machines,"IEEE Trans. Comput., vol. C-20, pp. 382-391, Apr. 1971.
[5] C. N. Liu, "A state variable assignment method for asynchronous sequential switching circuits,"J. ACM, vol. 10, pp. 209-216, Apr. 1963.
[6] G. K. Maki, J. H. Tracy, and R. J. Smith, II, "Generation of design equations in asynchronous sequential circuits,"IEEE Trans. Comput., vol. C-18, pp. 467-472, May 1969.
[7] A. D. Friedman, R. L. Graham, and J. D. Ullman, "Universal single transition time asynchronous state assignments,"IEEE Trans. Comput., vol. C-18, pp. 541-547, Jun 1969.
[8] R. J. Smith, II, "Generation of internal state assignments for large asynchronous sequential machines,"IEEE Trans. Comput., vol. C-23, pp. 924-932, Sept. 1974.
[9] T. Nanya and Y. Tohma, "On universal single transition time asynchronous state assignments,"IEEE Trans. Comput., vol. C-27, pp. 781-782, Aug. 1978.
[10] J. G. Kuhl and S. M. Reddy, "A multicode single transition-time state assignment for asynchronous sequential machines,"IEEE Trans. Comput., vol. C-27, pp. 927-934, Oct. 1978.
[11] T. Nanya and Y. Tohma, "Universal multicode STT state assignments for asynchronous sequential machines,"IEEE Trans. Comput., vol. C-28, pp. 811-818, Nov. 1979.
[12] L. A. Hollaar, "Direct implementation of asynchronous control units,"IEEE Trans. Comput., vol. C-31, pp. 1133-1141, Dec. 1982.
[13] G. K. Maki and J. H. Tracey, "A state assignment procedure for asynchronous sequential circuits,"IEEE Trans. Comput., vol. C-20, pp. 666-668, June 1971.
[14] G. Saucier, "State assignment of asynchronous sequential machines using graph techniques,"IEEE Trans. Comput., vol. C-21, pp. 282-288, Mar. 1972.
[15] S. H. Unger,Asynchronous Sequential Circuits. New York: Wiley Interscience, 1969.
[16] G. Saucier, "Encoding of asynchronous sequential networks,"IEEE Trans. Electron. Comput., vol. EC-16, pp. 365-369, June 1967.
[17] S. F. Wu and P. D. Fisher, "An artificial intelligence approach to the behavioral modeling of asynchronous sequential logic circuits," inProc. 33rd Midwest Symposium on Circuits and SystemsAug. 1990, pp. 1115-1118.
[18] K. J. Breeding,Digital Design Fundamentals. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[19] A. E. A. Almaini,Electronic Logic Systems, 2nd ed. United Kingdom: Prentice-Hall International, 1989.
[20] A. D. Friedman,Fundamentals of Logic Design and Switching Theory. Rockville, MD: Computer Science Press, 1986.
[21] S. F. Wu and P. David Fisher, "Automating the design of asynchronous sequential logic circuits,"IEEE J. Solid-State Circuits, pp. 364-370, Mar. 1991.

Index Terms:
state assignments; large-scale; asynchronous sequential logic circuits; race-free; race condition; intrinsic race; generated race; Node-Weight Diagram; cycles; states; asynchronous sequential logic; hazards and race conditions; logic design; sequential circuits; state assignment.
Citation:
P.D. Fisher, Sheng-Fu Wu, "Race-Free State Assignments for Synthesizing Large-Scale Asynchronous Sequential Logic Circuits," IEEE Transactions on Computers, vol. 42, no. 9, pp. 1025-1034, Sept. 1993, doi:10.1109/12.241592
Usage of this product signifies your acceptance of the Terms of Use.