The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1969 vol.18)
pp: 175-181
ABSTRACT
Armstrong, Friedman, and Menon have shown how fundamental-mode normal flow tables can be realized without delay elements under the constraint that line delays do not exceed a given chain of gate delays. The state assignments for these tables are designed to yield noncritical races and minimum transition times. This note presents an independently discovered alternative to their design procedure and also extends their results to totally sequential (or race-free) state assignments. The almost totally sequential state assignment is defined and presented as an approach toward delay-free realizations, under suitable line delay constraints, of nonnormal flow tables.
INDEX TERMS
Asynchronous sequential circuits, delay-free circuits, fundamental model circuits, nonnormal flow tables.
CITATION
O.G. Langdon, "Delay-Free Asynchronous Circuits with Constrained Line Delays", IEEE Transactions on Computers, vol.18, no. 2, pp. 175-181, February 1969, doi:10.1109/T-C.1969.222620
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool