This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis of Hazard-Free Asynchronous Circuits Based on Characteristic Graph
November 1997 (vol. 46 no. 11)
pp. 1246-1263

Abstract—To synthesize hazard-free asynchronous circuits from Signal Transition Graphs (STGs), we present a new Characteristic Graph (CG) to encapsulate all feasible solutions of the original STG in reduced size, which compares favorably with the state graph approach. Based on CG, we are able to explore the design space, as well as develop a necessary and sufficient condition for hazard-free realization on a predefined general circuit model, which has not yet been reported. The exact optimization for synthesis is shown to be NP hard. A heuristic method is thus proposed which results in efficient solutions while requiring very little CPU time.

[1] P.A. Beerel and T.H.-Y Meng, "Automatic Gate-Level Synthesis of Speed-Independent Circuits," Proc. ICCAD, pp. 581-586, 1992.
[2] P. Beerel and T.-Y. Meng, “Semi-Modularity and Testability of Speed-Independent Circuits,” Integration, the VLSI J., vol. 13, pp. 301-322, Sept. 1992.
[3] T.A. Chu, "Synthesis of Self-Timed Control Circuits from Graphical Specifications," PhD thesis, Massachusetts Inst. of Tech nolgy, June 1987.
[4] T.A. Chu, "Automatic Synthesis and Verification of Hazard-Free Control Circuits from Asynchronous Finite State Machine Specifications," Proc. ICCD, pp. 407-413, 1992.
[5] M. Hack, "Analysis of Production Schemata by Petri Nets," TR 94, Project MAC, Massachusetts Inst. of Tech nology, 1972.
[6] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[7] L. Lavagno,K. Keutzer,, and A. Sangiovanni-Vincentelli,“Algorithms for synthesis of hazard-free asynchronous circuits,” 1991 Design Automation Conf., pp. 302-308, June 1991.
[8] L. Lavagno, C.W. Moon, R.K. Brayton, and A. Sangiovanni Vincentelli, "Solving the State Assignment Problem for STG," Proc. 29th Design Automation Conf., pp. 568-572, 1992.
[9] K.J. Lin, J.W. Kuo, and C.S. Lin, "Direct Synthesis of Asynchronous Hazard-Free Circuits Based on Lock Relation and MG-Decomposition from STGs," Proc. European Conf. Design Automation, pp. 178-183, 1994.
[10] M.A. Kishinevsky, A.Y. Kondratyev, and A.R. Taubin, "Specification and Analysis of Self-Timed Circuits," J. VLSI Signal Processing, vol. 7, pp. 117-135, 1994.
[11] A. Kondratyev, M. Kishinevsky, B. Lin, P. Vanbekbergen, and A. Yakovlev, "Basic Gate Implementation of Speed-Independent Circuits," Proc. 31th Design Automation Conf., pp. 56-62, 1994.
[12] A.J. Martin, "Compiling Communication Process into Delay-Insensitive VLSI Circuits," J. Distributed Computing, vol. 1, pp. 226-234, 1986.
[13] T.H. Meng, Synchronization Design for Digital Systems. Kluwer Academic, 1990.
[14] R.E. Miller, Switching Theory, vol. 2. John Wiley&Sons, 1965.
[15] C.E. Molnar, T.P. Fang, and F.U. Rosenberger, "Synthesis of Delay-Insensitive Modules," Proc. Chapel Hill Conf. VLSI, pp. 67-86, 1985.
[16] C.W. Moon, P.R. Stephan, and R.K. Brayton, “Synthesis of Hazard-Free Asynchronous Circuits from Graphical Specifications,” Proc. Int’l Conf. Computer-Aided Design, IEEE CS Press, 1991, pp. 322-325.
[17] T. Murata, “Petri Nets: Properties, Analysis and Application,” Proc. IEEE, vol. 77, no. 4, 1989.
[18] E. Paster and J. Cortadella, "Polynomial Algorithm for the Synthesis of Hazard-Free Circuits from STGs," Proc. Int'l Cconf. Computer Aided Design, pp. 250-254, 1993.
[19] I. Sutherland, "Micropipelines," Comm. ACM, Vol. 32 No. 6, ACM Press, New York, June 1989.
[20] S.H. Unger, Asynchronous Sequential Switching Circuits.New York: Wiley-Interscience, 1969.
[21] P. Vanbekbergen et al., “Optimized Synthesis of Asynchronous Control Circuits from Graph-Theoretic Specifications,” Proc. ICCAD IEEE CS Press, 1990, pp. 184-187.
[22] V.I. Varshavky, Self-Timed Control of Concurrent Process. Kluwer Academic, 1990.
[23] K. Van Berkel, "Beware the Isochronic Fork," Integration VLSI J., vol. 13, no. 2, pp. 103-128, 1992.
[24] K. Van Berkel, "VLSI Programming of a Modulo-N Counter with Constant Response Times and Constant Power," Proc. 1993 IFIP Working Conf. Asynchronous Design Methodologies, pp. 1-11, 1993.
[25] T.E. Williams and M.A. Horowitz, "A Zero-Overhead Self-Timed 160-ns 54-b CMOS Divider," IEEE J. Solid-State Circuits, vol. 26, no. 11, pp. 1,651-1,661, Nov. 1991.
[26] F.K. Hwang, D.S. Richards, and P. Winter, The Steiner Tree Problem. North-Holland, 1992.
[27] C. Ykman-Couvreur, B. Lin, G. Goossens, and H.D. Man, "Synthesis and Optimization of Asynchronous Controllers Based on Extended Lock Graph Theory," Proc. European Conf. Design Automation, pp. 512-517, 1993.
[28] K.Y. Yun and D.L. Dill, "Synthesis of 3D Asynchronous State Machines," Proc. IEEE Int'l Conf. Computer Design, pp. 346-350, 1992.

Index Terms:
Asynchronous circuit, signal transition graph, hazard-freeness, characteristic graph, exact optimization.
Citation:
Kuan-Jen Lin, Chi-Wen Kuo, Chen-Shang Lin, "Synthesis of Hazard-Free Asynchronous Circuits Based on Characteristic Graph," IEEE Transactions on Computers, vol. 46, no. 11, pp. 1246-1263, Nov. 1997, doi:10.1109/12.644299
Usage of this product signifies your acceptance of the Terms of Use.