Sait, Sadiq M. and Zahra, Munir M. Tabu Search Based Circuit Optimization. In: Department of Computer Engineering, KFUPM.
In this paper we address the problem of optimizing mixed CMOS/BiCMOS circuits. The problem, formulated as a constrained combinatorial optimization problem is addressed using a tabu search algorithm. Initially a random approach is adopted for selecting among available solutions. Further, as an alternative competing solution the concepts of simulated evolution are applied to classical tabu search. This allows for a stochastic criterion for selecting among available solutions as compared to the random approach of classical tabu search. Only gates on the critical sesitizable paths are considered for optimization. Such a strategy leads to sizeable circuit speed improvement with minimum increase in the overall circuit capacitance. Compared to earlair approaches, the presented techniques produce circuits with remarkable increase in speed (greater than 20%) for very small incerase in overall circuit capacitance (less than 3%)
|Item Type:||Conference or Workshop Item (Other)|
|Divisions:||College Of Computer Sciences and Engineering > Computer Engineering Dept|
|Creators:||Sait, Sadiq M. and Zahra, Munir M.|
|Deposited On:||08 Mar 2008 15:44|
|Last Modified:||12 Apr 2011 13:08|
Repository Staff Only: item control page