Tabu search based circuit optimization

In this paper we address the problem of optimizing mixed CMOS/BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. Only gates on the critical sensitizable paths are considered for optimization. Such a strategy leads to sizable circuit speed improvement with minimum increase in the overall circuit capacitance. Compared to earlier approaches, the presented technique produces circuits with remarkable increase in speed (greater than 20%) for very small increase in overall circuit capacitance (less than 3%).

[1]  David Hung-Chang Du,et al.  Path sensitization in critical path problem [logic circuit design] , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Robert K. Brayton,et al.  Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network , 1989, 26th ACM/IEEE Design Automation Conference.

[3]  Fred W. Glover,et al.  Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..

[4]  Hugo De Man,et al.  Static Timing Analysis of Dynamically Sensitizable Paths , 1989, 26th ACM/IEEE Design Automation Conference.

[5]  Mohamed I. Elmasry,et al.  Digital BiCMOS Integrated Circuit Design , 1992 .

[6]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[7]  David Hung-Chang Du,et al.  Path sensitization in critical path problem , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[8]  Prithviraj Banerjee,et al.  ESP: A New Standard Cell Placement Package Using Simulated Evolution , 1987, 24th ACM/IEEE Design Automation Conference.

[9]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[10]  David Hung-Chang Du,et al.  Efficient Algorithms for Extracting the K Most Critical Paths in Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[11]  Sadiq M. Sait,et al.  Iterative Computer Algorithms and their Application to Engineering , 1999 .

[12]  Habib Youssef,et al.  Timing influenced force directed floorplanning , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

[13]  David Hung-Chang Du,et al.  On the General False Path Problem in Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[14]  J. Paul Roth,et al.  Diagnosis of automata failures: a calculus and a method , 1966 .

[15]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[16]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[17]  Jyuo-Min Shyu,et al.  A Polynomial-Time Heuristic Approach to Approximate a Solution to the False Path Problem , 1993, 30th ACM/IEEE Design Automation Conference.

[18]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[19]  David Hung-Chang Du,et al.  Critical path selection for performance optimization , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Hugo De Man,et al.  Timing verification using statically sensitizable paths , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..