Bridging modularity and optimality: delay-insensitive interfacing in asynchronous circuits synthesis
Hiroshi Saito,Alex Kondratyev,Jordi Cortadella,Luciano Lavagno,Alex Yakovlev +4 more
- 12 Oct 1999
- Vol. 3, pp 899-904
TL;DR: The approach allows logic synthesis to proceed independently for all the locally SI blocks and yields functionally correct circuits without requiring any synthesis/layout iteration or interaction, which simplifies dramatically the timing convergence problem for ASICs.
read more
Abstract: Two trends are of major concern for digital circuit designers: the relative increase of interconnect delays with respect to gate delays and the demand for design reuse. Both pose difficult problems to synchronous design styles, and can be tackled more naturally within the asynchronous paradigm. Unfortunately even in asynchronous design the normal hypotheses about the delays of gates and wires are often overly optimistic. One of the popular assumptions is to consider gate delays to be arbitrary while neglecting the skew in wire delays (so-called speed-independence (SI) assumption). Taking wire delays into account is possible and in its extreme leads to delay-insensitive (DI) implementations which work correctly under any wire delay distribution. However, such implementations are costly. This work suggests to separate all on-chip interconnections into two classes: local (for which the delays can be under control) and global (with arbitrary delays). This leads to locally SI globally DI implementations which are more practical than fully DI circuits and are in better correspondence with technology parameters than fully SI circuits. Our approach allows logic synthesis to proceed independently for all the locally SI blocks and yields functionally correct circuits without requiring any synthesis/layout iteration or interaction. This simplifies dramatically the timing convergence problem for ASICs. We tackle the problem at the behavior level and develop a simple transformation which ensures delay-insensitive properties for particular wires. The method is illustrated by a realistic design example. The preliminary experimental results show that the area and performance penalty are within 40% and 20%, respectively.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Towards Asynchronous A-D Conversion
D.J. Kinniment,B Gao,Alex Yakovlev,Fei Xia +3 more
- 01 Jan 1997
TL;DR: In this article, the authors compared the performance of asynchronous and synchronous A-D converters and showed that an asynchronous converter is more reliable than its synchronous counterpart, and that the bundled data design is also faster, on average, than the synchronous design.
2
System-level timing analysis and optimizations for hardware compilation
Seth Copen Goldstein,Girish Venkataramani +1 more
- 01 Jan 2007
TL;DR: This dissertation presents a System-Level Timing Analysis methodology and a micro-architectural optimization framework for use within hardware compilation to complement TLM-based synthesis flows by analyzing the sequential dependency behavior of system-level transactions.
2
Turing award lecture
Richard M. Karp
- 01 Oct 1985
TL;DR: Karp introduced the now standard methodlogy for proving problems to be NP-complete which has led to the identification of many theoretical and practical problems as being computationally difficult.
References
•Dissertation
Synthesis of self-timed vlsi circuits from graph-theoretic specifications
T. Chu
- 01 Jun 1987
TL;DR: This thesis presents an approach for direct and efficient synthesis of self-timed (asynchronous) control circuits from formal specifications called Signal Transition Graphs (STGs), and develops a number of analytical results which establish the equivalence between the static structure of nets and their underlying firing sequence semantics.
554
Turing Award lecture: it's time to reconsider time
TL;DR: When I was a student, there was no such thing as comp u t e r s c i e n c e a n d m y i n t eR e s t s w e r E s t r i c t l y mathemat ics .
64
A unified signal transition graph model for asynchronous control circuit synthesis
Alexandre Yakovlev,Luciano Lavagno,Alberto Sangiovanni-Vincentelli +2 more
- 01 Nov 1996
TL;DR: This work offers both low-level and high-level models for asynchronous circuits and the environment where they operate, together with strong equivalence results between the properties at the two levels, and outlines a design methodology based on these models.
53
A unified signal transition graph model for asynchronous control circuit synthesis
Yakovlev,Lavagno,Sangiovanni-Vincentelli +2 more
- 01 Jan 1992
TL;DR: In this article, both low-level and high-level models for asynchronous circuits and the environment where they operate, together with strong equivalence results between the properties at the low levels, are described.
47
Related Papers (5)
Priyadarsan Patra,Donald S. Fussell +1 more
- 03 Nov 1994
Mitchell A. Thornton,K. Fazel,R.B. Reese,C. Traver +3 more
- 04 Mar 2002