Asynchronous circuit synthesis with Boolean satisfiability

Asynchronous circuits are widely used in many real time applications such as digital communication and computer systems. The design of complex asynchronous circuits is a difficult and error-prone task. An adequate synthesis method will significantly simplify the design and reduce errors. In this paper, we present a general and efficient partitioning approach to the synthesis of asynchronous circuits from general Signal Transition Graph (STG) specifications. The method partitions a large signal transition graph into smaller and manageable subgraphs which significantly reduces the complexity of asynchronous circuit synthesis. Experimental results of our partitioning approach with large number of practical industrial asynchronous circuit benchmarks are presented. They show that, compared to the existing asynchronous circuit synthesis techniques, this partitioning approach achieves many orders of magnitude of performance improvements in terms of computing time, in addition to the reduced circuit implementation area. This lends itself well to practical asynchronous circuit synthesis from general STG specifications. >

[1]  Teresa H. Y. Meng,et al.  Automatic synthesis of asynchronous circuits from high-level specifications , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Jun Gu,et al.  Efficient local search for very large-scale satisfiability problems , 1992, SGAR.

[3]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[4]  Teresa H. Y. Meng,et al.  Automatic gate-level synthesis of speed-independent circuits , 1992, ICCAD '92.

[5]  Jun Gu,et al.  Area efficient synthesis of asynchronous interface circuits , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[6]  Luciano Lavagno,et al.  Algorithms for synthesis of hazard-free asynchronous circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[7]  Teresa H. Y. Meng,et al.  Synthesis of Timed Asynchronous CircuitsChris , 1993 .

[8]  Jun Gu,et al.  Local Search for Satissability (sat) Problem , 1993 .

[9]  Jun Gu,et al.  An efficient algorithm for microword length minimization , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[10]  P. A. Subrahmanyam,et al.  A new approach for checking the unique state coding property of signal transition graphs , 1992, [1992] Proceedings The European Conference on Design Automation.

[11]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[12]  Robert K. Brayton,et al.  Combinational test generation using satisfiability , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Jun Gu,et al.  Optimization Algorithms for the Satisfiability (SAT) Problem , 1994 .

[14]  James H. Tracey.  Internal State Assignments for Asynchronous Sequential Machines , 1966, IEEE Trans. Electron. Comput..

[15]  Chen-Shang Lin,et al.  Automatic synthesis of asynchronous circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[16]  Robert K. Brayton,et al.  Elimination of Dynamic Hazards by Factoring , 1993, 30th ACM/IEEE Design Automation Conference.

[17]  C. Ykman-Couvreur,et al.  Synthesis and optimization of asynchronous controllers based on extended lock graph theory , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[18]  Jun Gu,et al.  Local search for satisfiability (SAT) problem , 1993, IEEE Trans. Syst. Man Cybern..

[19]  Alain J. Martin,et al.  A 100-MIPS GaAs asynchronous microprocessor , 1994, IEEE Design & Test of Computers.

[20]  Robert K. Brayton,et al.  Specification, synthesis, and verification of hazard-free asynchronous circuits , 1994, J. VLSI Signal Process..

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

[22]  Jun Gu,et al.  Global Optimization for Satisfiability (SAT) Problem , 1994, IEEE Trans. Knowl. Data Eng..

[23]  Jun Gu,et al.  Multispace Search: A New Optimization Approach , 1994, ISAAC.

[24]  Jordi Cortadella,et al.  Polynomial algorithms for the synthesis for hazard-free circuits from signal transition graphs , 1993, ICCAD.

[25]  Jordi Cortadella,et al.  Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[26]  Chen-Shang Lin,et al.  On the verification of state-coding in STGs , 1992, ICCAD '92.

[27]  Hugo De Man,et al.  A generalized state assignment theory for transformations on signal transition graphs , 1994, J. VLSI Signal Process..

[28]  V. Rich.  Personal communication , 1989, Nature.

[29]  Robert K. Brayton,et al.  Solving the state assignment problem for signal transition graphs , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[30]  Michael Kishinevsky,et al.  Concurrent hardware : the theory and practice of self-timed design , 1993 .

[31]  Jun Gu,et al.  Signal transition graph constraints for speed-independent circuit synthesis , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[32]  Jun Gu,et al.  An efficient algorithm to search for minimal closed covers in sequential machines , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[34]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[35]  Chen-Shang Lin,et al.  On the verification of state-coding in STGs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[36]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[37]  Bill Lin,et al.  Minimization of symbolic relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[38]  Marly Roncken,et al.  Asynchronous circuits for low power: a DCC error corrector , 1994, IEEE Design & Test of Computers.

[39]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[40]  Hugo De Man,et al.  Optimized synthesis of asynchronous control circuits from graph-theoretic specifications , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..