Abstract
Various delay-insensitive circuits for modulo-N counters are formally derived and analyzed. Modulo-N counters are used in many circuit designs and have a simple specification, but allow for a surprising variety of decompositions into networks of basic components. We present three decompositions in detail. Along the way we explai our correctness criteria and show to analyze the area complexity and response time of each decomposition. Our final decomposition for the modulo-N counter has optimal area complexity of θ(logN) and optimal response time of θ(1).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C.H. van Baerkel, C. Niessen, M. Rem, and R. Saeijs. VLSI programming and solicon compilation: A novel approach from Philips Research. InProceedings of IEEE International Conference on Computer Design 1988. IEEE Computer Society Press, Washington, DC, 1988, pp. 150–166.
G.M. Brown. Towards truly delay-insensitive circuit realizations of process algebras. InProceedings of the Workshop on Designing Correct Circuits, G. Jones and M. Sheeran (eds.) Workshops in Computing., Springer-Verlag, Berlin, 1990, pp. 120–131.
W. Chen, J.T. Udding, and T. Verhoeff. Networks of communicating processes and their (decomposition. InMathematics of Program Construction, J.L.A. van de Snepscheut (ed).Lecture Notes in Computer Science 375: 174–196, 1989.
D.L. Dill.Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, Cambridge, MA, 1989.
J.C. Ebergen. A formal approach to designing delay-insensitive circuits.Distributed Computing, 5 (3):107–119, 1991.
M.B. Josephs and J.T. Udding. Delay-insensitive circuits. An algebraic approach to their design. InProceedings Concur 1990. Springer-Verlag, Berlin, 1990, pp. 342–366.
A.J. Martin. Programming in VLSI: From communicating processes to delay-insensitive circuits. InDevelopments in Concurrency and Communication, C.A.R. Hoare (ed.) Addison-Wesley, Reading, MA, 1990, pp. 1–64.
I.E. Sutherland. Micropipelines.Communications of the ACM, 32(6): 720–738, 1989.
S. Burns and A.J. Martin. Performance analysis and optimization of asynchronous circuits. InProceedings of the 1991 UC Santa Cruz Conference on VLSI, Carlo H. Sequin (ed.). MIT Press, Cambridge, MA, 1991, pp. 71–86.
M. Rem. Trace theory and systolic computations. InProceedings PARLE, Parallel Architectures and Languages Europe, Vol. 1, J.W. de Bakker, A.J. Nijman, and P.C. Treleaven (eds.), Springer-Verlag, Berlin, 1987, pp. 14–34.
C.A.R. Hoare.Communicating Sequential Processes, Prentice-Hall, London, 1985.
R.E. Miller,Switching Theory, Vol. 2, Chapter 10, Wiley, New York, 1965, pp. 199–244.
W.A. Clark. Macromoldular computer systems. InProceedings of the Spring Joint Computer Conference, AFIPS. Academic Press, London, 1967, pp. 335–401.
C.E. Molnar, T.P. Fang, and F.U. Rosenberger. Synthesis of delay-insensitive modules. InProceedings 1985 Chapel Hill Conference on VLSI, H. Fuchs (ed.). Computer Science Press, Rockville, MD, 1985, pp. 67–86.
J.T. Udding. A formal model for defining and classifying delay-insensitive circuits and systems,Distributed Computing, 1 (4): 197–204, 1986.
J.L.W. Kessels. Designing counters with bounded response time. InC.S. Scholten Dedicata: van oude machines en nieuwe rekenwijzen, W.H.J. Feijen and A.J.M. van Gasteren (ed.) Academic Service, Schoonhoven, 1990, pp. 127–140.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ebergen, J.C., Peeters, A.M.G. Design and analysis of delay-insensitive modulo-N counters. Form Method Syst Des 3, 211–232 (1993). https://doi.org/10.1007/BF01384074
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01384074