1996
DOI: 10.1109/43.503935
|View full text |Cite
|
Sign up to set email alerts
|

Transistor sizing for low power CMOS circuits

Abstract: A direct approach to transistor sizing for minimizing the power consumption of a CMOS circuit under a delay constraint is presented. In contrast to the existing assumption that the power consumption of a static CMOS circuit is proportional to the active area of the circuit, it is shown that the power consumption is a convex function of the active area. Analytical formulation for the power dissipation of a circuit in terms of the transistor size is derived which includes both the capacitive and the short circui… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

1997
1997
2021
2021

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 62 publications
(22 citation statements)
references
References 16 publications
0
22
0
Order By: Relevance
“…In order to quantify the amount of power saved, we use previously-reported research to estimate the amount of power that various functional units use [16,17,18]. From these sources we obtain power estimates assuming dynamic logic and relatively fast carry lookahead adders.…”
Section: Power Resultsmentioning
confidence: 99%
“…In order to quantify the amount of power saved, we use previously-reported research to estimate the amount of power that various functional units use [16,17,18]. From these sources we obtain power estimates assuming dynamic logic and relatively fast carry lookahead adders.…”
Section: Power Resultsmentioning
confidence: 99%
“…In order to quantify the amount of power saved, we use previously reported research to estimate the amount of power that various functional units use [Borah et al 1996;Ng et al 1996;Zimmermann and Fichtner 1997;Callaway and Swartzlander 1997]. From these sources we obtain power estimates assuming dynamic logic and relatively fast carry look-ahead adders.…”
Section: Power Results: Overviewmentioning
confidence: 99%
“…They developed several algorithms to minimize resources as power, speed and silicon area in one objective while restricting the other resources by an upper bound. Borah et al [4] minimize power while constraining the delay time.…”
Section: Background and Related Workmentioning
confidence: 99%