Critical Path Selection for Performance Optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 12, Issue 2, 1993, Pages 185-195

  Chen, Hsi Chuan ^a   Du, David Hung Chang ^a   Liu, Li Ren ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRITICAL PATH ANALYSIS; OPTIMIZATION; PERFORMANCE;

ISCAS85 BENCHMARK CIRCUITS;

COMBINATORIAL CIRCUITS;

EID: 0027541140     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.205000     Document Type: Article

References (18)

1. A. Al-Khalili, Y. Zhu, and D. Al-Khalili, “A module generator for optimized CMOS buffers,” in Proc. 26th Design Automation Conf., 1989, pp. 245–250.
2. J. Benkoski et al., “Timing verification using statically sensitizable paths,” IEEE Trans. Computer-Aided Design, vol. 9, pp. 1073–1084, Oct. 1990.
3. H. Chen and D. Du, “Path sensitization in critical path problem,” in Proc. IEEE Int. Conf. Computer-Aided Design, 1991, pp. 208–211.
4. K. Chen and S. Muroga, “Timing Optimization for multi-level combinational networks,” in Proc. 27th Design Automation Conf., 1990, pp. 339–344.
5. M. Cirit, “Transistor sizing in CMOS circuits,” in Proc. 24th Design Automation Conf, 1987, pp. 121–124.
6. J. Darringer et al., “LSS: A system for production logic synthesis,” IBM, Tech. Rep., 1984.
7. G. DeMicheli, “Performance-oriented synthesis in the Yorktown silicon compiler,” in Proc. IEEE Int. Conf. Computer-Aided Design, 1986, pp. 138–141.
8. S. Devadas, K. Keutzer, and S. Malik, “Delay computation in combinational logic circuits: Theory and algorithms,” in Proc. IEEE Int. Conf. Computer-Aided Design, 1991, pp. 176–179.
9. J. Fishburn, “A depth-decreasing heuristic for combinational logic; or How to Convert a ripple-carry adder into a carry-lookahead adder or anything in-between,” in Proc. 27th Design Automation Conf., 1990, pp. 361–364.
10. J. Fishburn and A. Dunlop, “TILOS: A polynomial programming approach to transistor sizing,” in Proc. IEEE Int. Conf. Computer-Aided Design, 1985, pp. 326–328.
11. L. Gasser and L. Hoyte, “Delay and power optimization in VLSI circuit,” in Proc. 21st Design Automation Conf., 1984, pp. 529–535.
12. N. Hedenstierna and K. Jeppson, “CMOS circuit speed and buffer optimization,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 270–281, 1987.
13. W. Kao, N. Fathi, and C. Lee, “Algorithms for automatic transistor sizing in CMOS digital circuits,” in Proc. 22nd Design Automation Conf., 1985, pp. 781–784.
14. L. Liu, D. Du, and H. Chen, “An efficient parallel critical path algorithm,” in Proc. 28th Design Automation Conf., 1991, pp. 535–540.
15. D. Maple, “Transistor size optimization in the tailor layout system,” in Proc. 26th Design Automation Conf., 1989, pp. 43–48.
16. P. McGeer and R. Brayton, “Efficient algorithms for computing the longest viable path in a combinational network,” in Proc. 26th Design Automation Conf., 1989, pp. 561–567.
17. P. McGeer, R. Brayton, S. Sahni, and A. Sangiovanni-Vincentelli, “Performance enhancement through the generalized bypass transform” in Proc. IEEE Int. Conf. Computer-Aided Design, 1991, pp. 184–187.
18. F. Obermeier and R. Katz, “An electrical optimizer that considers physical layout,” in Proc. 25th Design Automation Conf., 1988, pp. 453–459.