Skip to main content
SpringerLink
Log in

Delay-insensitive codes — an overview

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

The problem of delay-insensitive data communication is described. The notion of delay-insensitive code is defined, giving precise conditions under which delay-insensitive data communication is feasible. Examples of these codes are presented and analyzed. It appears that delay-insensitive codes are equivalent with antichains in partially ordered sets and with all unidirectional error-detecting codes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Berger JM (1961) A note on error detection codes for asymmetric channels. Inf Control 4:68–73

    Google Scholar 

  • Bose B, Rao TRN (1982) Theory of unidirectional error correcting/detecting codes. IEEE Trans Comput C-31:521–530

    Google Scholar 

  • Freiman CV (1962) Optimal error detection codes for completely asymmetric binary channels. Inf Control 5:64–71

    Google Scholar 

  • Greene C, Kleitman DJ (1978) Proof techniques in the theory of finite sets. In: Rota G-C (ed) Studies in combinatorics. The Mathematical Association of America, pp 22–79

  • Hollaar LA (1982) Direct implementation of asynchronous control units. IEEE Trans Comput C-31:1133–1141

    Google Scholar 

  • Knuth DE (1986) Efficient balanced codes. IEEE Trans Inf Theory IT-32:51–53

    Google Scholar 

  • van Overveld WMCJ (1985) On arithmetic operations withm-out-of-n codes. Computing Science Notes, no 85/02, Dept Math Comp Sci, Eindhoven University of Technology, The Netherlands

    Google Scholar 

  • Seitz CL (1980) System timing. In: Mead CA, Conway LA (eds) Introduction to VLSI systems. Addison-Wesley, Reading MA, pp 218–262

    Google Scholar 

  • Sperner E (1928) Ein Satz über Untermengen einer endlichen Menge. Math Z 27:544–548

    Google Scholar 

  • Udding JT (1986) A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing 1:197–204

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB, Eindhoven, The Netherlands

    Tom Verhoeff

Authors
  1. Tom Verhoeff
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Tom Verhoeff received the B.S. and M.S. degrees in mathematics from Eindhoven University of Technology, The Netherlands, in 1985. He is currently an Assistant Professor at the Department of Mathematics and Computing Science of the same university. His main research interests are parallel computations, especially formalisms for their specification and design, and their implementation as delay-insensitive VLSI circuits.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Verhoeff, T. Delay-insensitive codes — an overview. Distrib Comput 3, 1–8 (1988). https://doi.org/10.1007/BF01788562

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788562

Key words

Search

Navigation