[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Computer-aided synthesis and verification of gate-level timed circuits
Publisher:
  • Stanford University
  • 408 Panama Mall, Suite 217
  • Stanford
  • CA
  • United States
Order Number:UMI Order No. GAX96-12015
Reflects downloads up to 31 Dec 2024Bibliometrics
Skip Abstract Section
Abstract

In recent years, there has been a resurgence of interest in the design of asynchronous circuits due to their ability to eliminate clock skew problems, achieve average case performance, adapt to processing and environmental variations, provide component modularity, and lower system power requirements. Traditional academic asynchronous designs methodologies use unbounded delay assumptions, resulting in circuits that are verifiable, but ignore timing for simplicity, leading to unnecessarily conservative designs. In industry, however, timing is critical to reduce both chip area and circuit delay. Due to a lack of formal methods that handle timing information correctly, circuits with timing constraints usually require extensive simulation to gain confidence in the design.This thesis bridges this gap by introducing timed circuits in which explicit timing information is incorporated into the specification and utilized throughout the design procedure to optimize the implementation. Our timed circuits are more efficient than those produced using untimed methods and more reliable than those produced using ad hoc design techniques. Timing analysis, however, often introduces substantial complexity into the design procedure, and has hitherto either been avoided, simplified, or considered only after synthesis. In this thesis, we describe an exact and efficient timing analysis algorithm, and its application to the automatic synthesis and verification of gate-level timed circuits. Our synthesis procedure generates hazard-free timed circuits and maps the resulting implementations to practical semi-custom gate libraries. The resulting implementations are up to 40 percent smaller and 50 percent faster than previous asynchronous designs. We also demonstrate that our timed designs can be smaller and faster than their synchronous counterparts. After back-annotating the synthesized circuits, our verification procedure checks that all circuits satisfy their specifications. This procedure has also been applied to a wide collection of highly concurrent timed circuits that could not previously be verified.

Cited By

  1. Zheng H, Rodriguez E, Zhang Y and Myers C A compositional minimization approach for large asynchronous design verification Proceedings of the 19th international conference on Model Checking Software, (62-79)
  2. Yoneda T and Myers C Effective contraction of timed STGs for decomposition based timed circuit synthesis Proceedings of the 4th international conference on Automated Technology for Verification and Analysis, (229-244)
  3. Jacobson H, Myers C and Gopalakrishnan G Achieving fast and exact hazard-free logic minimization of extended burst-mode gC finite state machines Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, (303-311)
  4. ACM
    Stevens K, Rotem S, Burns S, Cortadella J, Ginosar R, Kishinevsky M and Roncken M CAD directions for high performance asynchronous circuits Proceedings of the 36th annual ACM/IEEE Design Automation Conference, (116-121)
  5. Cortadella J, Kishinevsky M, Burns S and Stevens K Synthesis of asynchronous control circuits with automatically generated relative timing assumptions Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, (324-331)
  6. Rotem S, Stevens K, Dike C, Roncken M, Agapiev B, Ginosar R, Kol R, Beerel P, Myers C and Yun K RAPPID Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
  7. Belluomini W, Myers C and Hofstee H Verification of Delayed-Reset Domino Circuits Using ATACS Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
  8. Stevens K, Rotem S and Ginosar R Relative Timing Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
  9. ACM
    Cortadella J, Kishinevsky M, Kondratyev A, Lavagno L, Taubin A and Yakovlev A Lazy transition systems Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (324-331)
  10. Sjogren A and Myers C Interfacing Synchronous and Asynchronous Modules Within a High-Speed Pipeline Proceedings of the 17th Conference on Advanced Research in VLSI (ARVLSI '97)
Contributors
  • The University of Utah

Index Terms

  1. Computer-aided synthesis and verification of gate-level timed circuits
      Please enable JavaScript to view thecomments powered by Disqus.

      Recommendations