Tabu Search Based Circuit Optimization. In: Department of Computer Engineering, KFUPM.

Preview

PDF Tabu.Search.Based.Circuit.Optimization.pdf Download (404kB) | Preview

Abstract

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)
Subjects:	Computer
Department:	College of Computing and Mathematics > Computer Engineering
Depositing User:	AbdulRahman
Date Deposited:	08 Mar 2008 12:44
Last Modified:	01 Nov 2019 13:23
URI:	http://eprints.kfupm.edu.sa/id/eprint/226