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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
1998
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14632/1/14632_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14632/2/14632_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|