Issue No. 07 - July (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.709380
<p><b>Abstract</b>—A comparison-based decoder detects the arrival of a code word by comparing the received checkbits with the checkbits computed using the received data. Implementation issues underlying <it>comparison-based</it> decoders for systematic <it>delay-insensitive</it> (DI) or <it>unordered</it> codes is the subject of this paper. We show that if the decoder is to be implemented using <b>asynchronous logic</b>, i.e., if the gate and wire delays are arbitrary (unbounded but finite), then it is impossible to design a comparison-based decoder for any code that is more efficient than a dual-rail code. In other words, the encoded word must contain at least twice as many bits as the data. In addition, the codes should satisfy two other properties, called the initial condition and the all-zero lower triangle (AZLT) property, for the realization of a delay-insensitive comparison-based decoder. The paper shows that comparison-based decoders for codes that have the requisite level of redundancy and that satisfy the two properties can be implemented using asynchronous logic.</p>
Delay-insensitive codes, self-timed design, delay-insensitive communication, block codes.
G. Robert Redinbo, Nitin H. Vaidya, Venkatesh Akella, "Asynchronous Comparison-Based Decoders for Delay-Insensitive Codes", IEEE Transactions on Computers, vol. 47, no. , pp. 802-811, July 1998, doi:10.1109/12.709380