Synthesis of Timed Circuits Based on Decomposition

This paper presents a decomposition-based method for timed circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesizes each output individually. It begins by contracting the timed signal transition graph (STG) to include only transitions on the output of interest and its possible trigger signals. Next, the reachable state space for this contracted STG is analyzed to determine a minimal number of additional signals, which must be reintroduced into the STG to obtain complete state coding. The circuit for this output is then synthesized from this STG. Results show that the quality of the circuit implementation is nearly as good as the one found from the full reachable state space, but it can be applied to find circuits for which full-state-space methods cannot be successfully applied. The proposed method has been implemented as a part of our tool Nii-Utah Timed Asynchronous circuit Synthesis system (nutas), and its first version is available at http://research.nii.ac.jp/~yoneda.

[1]  Marly Roncken,et al.  The VLSI-programming language Tangram and its translation into handshake circuits , 1991, Proceedings of the European Conference on Design Automation..

[2]  Chris J. Myers,et al.  High level synthesis of timed asynchronous circuits , 2005, 11th IEEE International Symposium on Asynchronous Circuits and Systems.

[3]  Chris J. Myers,et al.  Synthesis of speed independent circuits based on decomposition , 2004, 10th International Symposium on Asynchronous Circuits and Systems, 2004. Proceedings..

[4]  Alain J. Martin,et al.  Syntax-directed translation of concurrent programs into self-timed circuits , 1988 .

[5]  Chris J. Myers,et al.  Modular verification of timed circuits using automatic abstraction , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Chris J. Myers,et al.  Computer-aided synthesis and verification of gate-level timed circuits , 1996 .

[7]  Jeong-Gun Lee,et al.  Automatic process-oriented control circuit generation for asynchronous high-level synthesis , 2000, Proceedings Sixth International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2000) (Cat. No. PR00586).

[8]  Kiyoshi Oguri,et al.  Asynchronous Circuit Design , 2001 .

[9]  Teresa H. Y. Meng,et al.  Covering conditions and algorithms for the synthesis of speed-independent circuits , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Niraj K. Jha,et al.  MINIMALIST: An Environment for the Synthesis, Verification and Testability of Burst-Mode Asynchronous Machines , 1999 .

[11]  Walter Vogler,et al.  Decomposition in Asynchronous Circuit Design , 2002, Concurrency and Hardware Design.

[12]  Alex Yakovlev,et al.  Asynchronous circuit synthesis by direct mapping: interfacing to environment , 2002, Proceedings Eighth International Symposium on Asynchronous Circuits and Systems.

[13]  Jun Gu,et al.  A Modular Partitioning Approach for Asynchronous Circuit Synthesis , 1994, 31st Design Automation Conference.

[14]  Josep Carmona,et al.  ILP Models for the Synthesis of Asynchronous Control Circuits , 2003, ICCAD.

[15]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[16]  Teresa H. Y. Meng,et al.  Synthesis of timed asynchronous circuits , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[17]  Luciano Lavagno,et al.  Petrify: A Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers (Special Issue on Asynchronous Circuit and System Design) , 1997 .

[18]  Chris J. Myers,et al.  Synthesizing Timed Circuits from High Level Specification Languages , 2003 .

[19]  Chris J. Myers,et al.  Direct synthesis of timed circuits from free-choice STGs , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Hiroshi Saito,et al.  A zero-time-overhead asynchronous four-phase controller , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[21]  Sanjit A. Seshia,et al.  Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods , 2003, CAV.

[22]  Ralf Wollowski,et al.  From STG to extended-burst-mode machines , 1999, Proceedings. Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[23]  Chris J. Myers,et al.  Improved POSET Timing Analysis in Timed Petri Nets , 2001 .

[24]  Tomohiro Yoneda,et al.  Efficient Verification of Parallel Real–Time Systems , 1993, Formal Methods Syst. Des..

[25]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[26]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[27]  Chris J. Myers,et al.  Modular Synthesis of Timed Circuits using Partial Order Reduction , 2002, Theory and Practice of Timed Systems @ ETAPS.

[28]  Tam-Anh Chu,et al.  Synthesis of self-timed VLSI circuits from graph-theoretic specifications , 1987 .

[29]  Joep L. W. Kessels,et al.  The Tangram framework: asynchronous circuits for low power , 2001, Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455).

[30]  Maciej Koutny,et al.  Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT , 2006, Fundam. Informaticae.

[31]  Josep Carmona,et al.  Synthesis of asynchronous controllers using integer linear programming , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[32]  Doug A. Edwards,et al.  Balsa: An Asynchronous Hardware Synthesis Language , 2002, Comput. J..

[33]  Maciej Koutny,et al.  Logic synthesis for asynchronous circuits based on Petri net unfoldings and incremental SAT , 2004, Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004..

[34]  T. Chelcea,et al.  Resynthesis and peephole transformations for the optimization of large-scale asynchronous systems , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).