Self-Timed Iteration

Abstract

This paper describes a technique for specifying, analyzing and implementing a series of computations using iterative, self-timed circuits. Even though the circuits iterate, they operate without clocking. The circuits do not require arbiters, have no possibility of synchronization failure, and function correctly independent of time delays. Each computation in the iteration can be a general function and is implemented using asynchronous, delay-independent logic which indicates its completion. A general implementation for self-timed iteration is presented; then, simplifying assumptions for specific implementations are shown which can reduce the amount of hardware required.