The Community for Technology Leaders
Green Image
This paper considers the general problem of the synthesis of asynchronous combinational and sequential circuits based on the assumption that gate delays may be unbounded and that line delays are suitably constrained. Certain problems inherent to circuit realizations with unbounded gate delays are discussed and methods of solving them are proposed. Specific synthesis techniques are presented for both combinational and sequential circuits. The use of completion detection necessitated by the assumption of unbounded gate delays also causes the circuits to stop operating for approximately half of all possible single faults, thus achieving a degree of self-checking.
Asynchronous sequential circuits, combinational circuits, completion detection, unbounded gate delays.

A. Friedman, D. Armstrong and P. Menon, "Design of Asynchronous Circuits Assuming Unbounded Gate Delays," in IEEE Transactions on Computers, vol. 18, no. , pp. 1110-1120, 1969.
203 ms
(Ver 3.3 (11022016))