Lazy transition systems and asynchronous circuits synthesis with relative timing assumptions
Visualitza/Obre
Cita com:
hdl:2117/126134
Tipus de documentArticle
Data publicació2002-02
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
This paper presents a design flow for timed asynchronous circuits. It introduces lazy transitions systems as a new computational model to represent the timing information required for synthesis. The notion of laziness explicitly distinguishes between the enabling and the firing of an event in a transition system. Lazy transition systems can be effectively used to model the behavior of asynchronous circuits in which relative timing assumptions can be made on the occurrence of events. These assumptions can be derived from the information known a priori about the delay of the environment and the timing characteristics of the gates that will implement the circuit. The paper presents the necessary conditions to generate circuits and a synthesis algorithm that exploits the timing assumptions for optimization. It also proposes a method for back-annotation that derives a set of sufficient timing constraints that guarantee the correctness of the circuit.
CitacióCortadella, J., Kishinevsky, M., Burns, S., Kondratyev, A., Lavagno, L., Stevens, K., Taubin, A., Yakovlev, A. Lazy transition systems and asynchronous circuits synthesis with relative timing assumptions. "IEEE transactions on computer-aided design of integrated circuits and systems", Febrer 2002, vol. 21, núm. 2, p. 109-130.
ISSN0278-0070
Versió de l'editorhttps://ieeexplore.ieee.org/document/980253
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
00980253.pdf | 509,4Kb | Visualitza/Obre |