Dual-[Formula Omitted] Buffer Insertion for Power Reduction

Whereas the van Ginneken algorithm can be extended to handle the new problem formulation optimally, its time complexity increases from quadratic time [Formula Omitted] to pseudopolynomial time [Formula Omitted], where [Formula Omitted] is the size of buffer library, [Formula Omitted] is the number o...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computer-aided design of integrated circuits and systems Vol. 27; no. 8; p. 1498
Main Authors King Ho Tam, King Ho Tam, Yu Hu, Yu Hu, Lei He, Lei He, Tom Tong Jing, Tom Tong Jing, Xinyi Zhang, Xinyi Zhang
Format Journal Article
LanguageEnglish
Published New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.08.2008
Subjects
Algorithms
Buffers
Complexity
Delay
Insertion
Pruning
Reduction
Sampling
Studies
Online AccessGet full text

Cover

More Information
Summary:Whereas the van Ginneken algorithm can be extended to handle the new problem formulation optimally, its time complexity increases from quadratic time [Formula Omitted] to pseudopolynomial time [Formula Omitted], where [Formula Omitted] is the size of buffer library, [Formula Omitted] is the number of buffer stations, and [Formula Omitted] is proportional to the number of all possible subtrees of the net.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2008.925784