"This paper describes the known methods of generating next-state equations for asynchronous sequential circuits operating in normal fundamental mode. First, the methods that have been previously developed by other authors are explained and correlated in a simple and uniform language in order that the subtle differences of these approaches can be seen. This review is then followed by a development of a new method for generating minimal next-state equations which has some advantages over the previous methods. From the comparison of the previous known methods, it is noted that any one of these methods may be desirable for certain designs since each has some advantages that the others do not have. However, these methods also have limitations in that some methods can only be used with particular types of assignments. Also, as flow tables become larger the amount of work required to use some of these methods becomes excessive and tedious. The method developed here is a simple and straightforward approach which can be used for any unicode, single transition time assignment and will easily lend itself to computer application. The heart of this method emanates from the role that the Karnaugh map plays in the conventional approach for generating the next-state equations. The main advantage of this method seems to be its capability and proficiency in handling large flow tables"--Abstract, pages ii-iii.
Tracey, James H.
Tranter, William H.
Electrical and Computer Engineering
M.S. in Electrical Engineering
University of Missouri--Rolla
vii, 102 pages
© 1970 Gregory Martin Bednar, All rights reserved.
Thesis - Open Access
Asynchronous circuits -- Computer-aided design
Asynchronous circuits -- Testing
Sequential circuits -- Testing
Electronic circuit design
Print OCLC #
Electronic OCLC #
Link to Catalog Record
Bednar, Gregory Martin, "Next-state equation generation for asynchronous sequential circuits - normal mode" (1970). Masters Theses. 5467.