Design and analysis of delay-insensitive modulo-N counters

J.C. Ebergen, A.M.G. Peeters

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

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).
Original languageEnglish
Pages (from-to)211-232
JournalFormal Methods in System Design
Volume3
Issue number3
DOIs
Publication statusPublished - 1993

Fingerprint

Modulo
Decomposition
Decompose
Response Time
Delay circuits
Circuit Design
Correctness
Specification
Specifications
Design
Networks (circuits)

Cite this

Ebergen, J.C. ; Peeters, A.M.G. / Design and analysis of delay-insensitive modulo-N counters. In: Formal Methods in System Design. 1993 ; Vol. 3, No. 3. pp. 211-232.
@article{04e30fdad03d4680855329885e292881,
title = "Design and analysis of delay-insensitive modulo-N counters",
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).",
author = "J.C. Ebergen and A.M.G. Peeters",
year = "1993",
doi = "10.1007/BF01384074",
language = "English",
volume = "3",
pages = "211--232",
journal = "Formal Methods in System Design",
issn = "0925-9856",
publisher = "Springer",
number = "3",

}

Design and analysis of delay-insensitive modulo-N counters. / Ebergen, J.C.; Peeters, A.M.G.

In: Formal Methods in System Design, Vol. 3, No. 3, 1993, p. 211-232.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Design and analysis of delay-insensitive modulo-N counters

AU - Ebergen, J.C.

AU - Peeters, A.M.G.

PY - 1993

Y1 - 1993

N2 - 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).

AB - 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).

U2 - 10.1007/BF01384074

DO - 10.1007/BF01384074

M3 - Article

VL - 3

SP - 211

EP - 232

JO - Formal Methods in System Design

JF - Formal Methods in System Design

SN - 0925-9856

IS - 3

ER -