Hierarchical Optimization of Asynchronous Circuits

Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and communicate with each other. This paper is concerned with the problem of synthesizing such hierarchically defined systems. When the individual components are synthesized and implemented separately, it is desirable to take into account the degrees of freedom that arise from the interactions with the other components and from the specification. Specifically, we consider how one can find the set of implementations that can be "correctly substituted" for a component in the system while preserving the behavior of the total system. The notion of correct substitution is formally defined for a hierarchical network of possibly non-deterministic modules and a new solution framework based on trace theory is presented to compute and represent this complete set of correct substitutions. We show that the complete set can be captured by a single trace structure using the notion of a "maximal trace structure". We indicate how asynchronous synthesis methods may be applied to explore the solution space e.g. to generate a delay-insensitive implementation.

[1]  Ganesh Gopalakrishnan,et al.  SHILPA: a high-level synthesis system for self-timed circuits , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[2]  J. Davenport.  Editor , 1960 .

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

[4]  Jan L. A. van de Snepscheut,et al.  Trace theory and the definition of hierarchical components , 1983 .

[5]  Peter A. Beerel,et al.  Automatic gate-level synthesis of speed-independent circuits , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

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

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

[8]  David L. Dill,et al.  Automatic synthesis of 3D asynchronous state machines , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

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

[10]  Kenneth Y. Yun,et al.  Synthesis of 3D asynchronous state machines , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

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

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

[13]  van Ch Kees Berkel.  Handshake circuits : an intermediary between communicating processes and VLSI , 1992 .

[14]  Erik Brunvand,et al.  Translating concurrent programs into delay-insensitive circuits , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[15]  Jan L. A. van de Snepscheut,et al.  Trace Theory and VLSJ Design , 1985, Lecture Notes in Computer Science.

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

[17]  Victor I. Varshavsky,et al.  Self-Timed Control of Concurrent Processes , 1989 .

[18]  J. C. Ebergen.  Translating programs into delay-insensitive circuits , 1989 .

[19]  Ganesh Gopalakrishnan,et al.  A correctness criterion for asynchronous circuit validation and optimization , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Bill Lin,et al.  Modeling and optimization of hierarchical synchronous circuits , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[21]  Bill Lin,et al.  A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules , 1994, 31st Design Automation Conference.

[22]  Chantal Ykman-Couvreur,et al.  Externally Hazard-Free Implementations of Asynchronous Circuits , 1995, 32nd Design Automation Conference.

[23]  Alexandre Yakovlev,et al.  Basic Gate Implementation of Speed-Independendent Circuits , 1994, 31st Design Automation Conference.