A Modular Partitioning Approach for Asynchronous Circuit Synthesis

Asynchronous circuits are crucial in designing low power and high performance digital systems. In this paper, we present an efficient modular partitioning approach for asynchronous circuit synthesis. This approach partitions a large circuit specification into smaller and manageable modules that drastically reduces the synthesis complexity. Experimental results with a large number of practical asynchronous benchmarks are presented. They show that, compared to the existing techniques, this modular partitioning method achieves many orders of magnitude of performance improvement in terms of computing time, in addition to a reduced implementation area. It offers a practical solution for complex asynchronous circuit design problems.

[1]  Jun Gu,et al.  A Novel Discrete Relaxation Architecture , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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

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

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

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

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

[9]  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.

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

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

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

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

[14]  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.

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

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

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

[18]  G. Goossens,et al.  A generalized state assignment theory for transformations on signal transition graphs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

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

[20]  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.

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

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

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

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

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

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

[29]  Jun Gu,et al.  A divide-and-conquer approach for asynchronous interface synthesis , 1994, Proceedings of 7th International Symposium on High-Level Synthesis.

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

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

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

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

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

[35]  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..

[36]  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.

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

[38]  Jun Gu,et al.  Asynchronous circuit synthesis: persistency and complete state coding constraints in signal transition graphs , 1993 .

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

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