| Article ID: | iaor20082658 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 2 |
| Start Page Number: | 129 |
| End Page Number: | 162 |
| Publication Date: | Jun 2007 |
| Journal: | Optimization and Engineering |
| Authors: | Wang Wenxin, Areibi Shawki, Anis Mohab |
| Keywords: | engineering, optimization, combinatorial optimization |
Reducing power dissipation is one of the most important issues in VLSI design today. Scaling causes subthreshold leakage currents to become a large component of total power dissipation. Multi-Threshold CMOS (MTCMOS) technology has emerged as a promising technique to reduce leakage power. This paper first introduces how to model the sleep transistor sizing problem in the MTCMOS circuits as a Bin-Packing Problem (BPP). The gate-clustering BPP and the First-Fit techniques are also introduced to further improve the solution quality. To take the circuit’s routing complexity into consideration which is critical for Deep Sub-Micron (technologies that are 0.25 μm and below) implementations, a Set-Partitioning Problem is then formed. However, this highly constrained model limits its application for large circuit design. A Set-Covering model is therefore investigated to efficiently solve the problem.