This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1969 (vol. 18 no. 12)
pp. 1110-1120
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.
Index Terms:
Asynchronous sequential circuits, combinational circuits, completion detection, unbounded gate delays.
Citation:
D.B. Armstrong, A.D. Friedman, P.R. Menon, "Design of Asynchronous Circuits Assuming Unbounded Gate Delays," IEEE Transactions on Computers, vol. 18, no. 12, pp. 1110-1120, Dec. 1969, doi:10.1109/T-C.1969.222594
Usage of this product signifies your acceptance of the Terms of Use.