DocumentCode
2048848
Title
Leakage minimization of nano-scale circuits in the presence of systematic and random variations
Author
Bhardwaj, Sarvesh ; Vrudhula, Sarma B K
Author_Institution
Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
fYear
2005
fDate
13-17 June 2005
Firstpage
541
Lastpage
546
Abstract
This paper presents a novel gate sizing methodology to minimize the leakage power in the presence of process variations. The leakage and delay are modeled as posynomials functions to formulate a geometric programming problem. The existing statistical leakage model of Rao et al. (2004) is extended to include the variations in gate sizes as well as systematic variations. We propose techniques to efficiently evaluate constraints on the α-percentile of the path delays without enumerating the paths in the circuit. The complexity of evaluating the objective function is O(|N|2) and that of evaluating the delay constraints is O(|N| + |E|) for a circuit with |N| gates and |E| wires. The optimization problem is then solved using a convex optimization algorithm that gives an exact solution.
Keywords
circuit complexity; circuit optimisation; convex programming; geometric programming; integrated circuit design; leakage currents; nanotechnology; convex optimization; gate sizing; geometric programming; leakage minimization; nanoscale circuits; posynomials functions; random variations; systematic variations; Algorithm design and analysis; Circuit optimization; Computer science; Delay; Functional programming; Lenses; Minimization; Power engineering and energy; Power system modeling; Solid modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2005. Proceedings. 42nd
Print_ISBN
1-59593-058-2
Type
conf
DOI
10.1109/DAC.2005.193868
Filename
1510388
Link To Document