Engineering Commons^™

State Assignment Selection In Asynchronous Sequential Circuits, Gary K. Maki, James H. Tracey

Electrical and Computer Engineering Faculty Research & Creative Works

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.