Advertisement

Implementation conditions for delay insensitive circuits

  • Anders Gammelgaard
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 365)

Abstract

Designs of delay insensitive circuits must be proven correct in two different respects. First it must be demonstrated that a design meets its functional specification. Second it must be assured that it tolerates arbitrary delays in its individual components. The latter proof requires a model explicitly mentioning wire delays, whereas the former is much easier carried out in a model neglecting such delays.

In this paper we show how explicit treatment of wire delays can be substituted by a set of implementation conditions imposed on a model neglecting wire delays. When the conditions are satisfied, the circuit is assured to be delay insensitive.

The implementation conditions are directed towards circuits consisting of self-timed elements using delay insensitive coding for data transfer.

Keywords

Transition System Single Activation Opposed Activation Reachable State Delay Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Elmstrøm R., J. Frich Hansen and L. Møller Jørgensen, Systoliske algorithmer realiseret asynkront. Master's thesis [in danish], University at Århus, Computer Science Department, Ny Munkegade, DK-8000 Århus C, 1988.Google Scholar
  2. [2]
    Gammelgaard A., Inheriting safety properties of concurrent programs. To be published.Google Scholar
  3. [3]
    Greenstreet M. R., T. E. Williams and J. Staunstrup, Self-Timed Iteration. Proceedings from VLSI-87, Vancouver (editor C. Sequin), North Holland 1987.Google Scholar
  4. [4]
    Martin A. J., Compiling Communicating Processes into Delay-Insensitive VLSI Circuits. Distributed Computing, 1 (1986), pp. 226–234.CrossRefGoogle Scholar
  5. [5]
    Miller R. E., Switching Theory, vol. 2, ch. 10. Wiley 1969.Google Scholar
  6. [6]
    Molnar C. E., Fang T., Rosenberger F. U., Synthesis of Delay-Insensitive Modules. Proceedings from 1985 Chapel Hill Conference on VLSI (editor H. Fuchs), pp. 67–86.Google Scholar
  7. [7]
    Seitz C., "System Timing". in Introduction to VLSI Systems, eds. C. Mead and L. Conway, Addison-Wesley Publishing Company 1980.Google Scholar
  8. [8]
    van de Snepscheut J. L. A., Trace theory and VLSI design. Lecture Notes in Computer Science 200, Springer 1985.Google Scholar
  9. [9]
    Staunstrup J. and M. R. Greenstreet, From High-Level Descriptions to VLSI Circuits. BIT, 28 (1988), pp. 620–638.Google Scholar
  10. [10]
    Toubro Nielsen E. and C. Riber Christensen, Opbygning af haendelsesstyrede kredsløb i VLSI. Master's thesis [in danish]. University at Århus, Computer Science Department, Ny Munkegade, DK-8000 Århus C, 1988.Google Scholar
  11. [11]
    Udding J. T., Classification and Composition of Delay-Insensitive Circuits. Doctoral Dissertation, Eindhoven University of Technology, 1984.Google Scholar
  12. [12]
    Udding J. T., A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing, 1 (1986), pp. 197–204.CrossRefGoogle Scholar
  13. [13]
    Verhoeff T., Delay-insensitive codes — an overview. Distributed Computing, 3 (1988), pp. 1–8.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Anders Gammelgaard
    • 1
  1. 1.Computer Science DepartmentÅrhus University Ny MunkegadeÅrhus C

Personalised recommendations