File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Gate sizing for cell-library-based designs

TitleGate sizing for cell-library-based designs
Authors
KeywordsDiscretization
Dynamic programming (DP)
Gate sizing
Pruning
Sparse cell library
Issue Date2009
Citation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2009, v. 28, n. 1, p. 818-825 How to Cite?
AbstractWith increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shift, the problem of discrete gate sizing has received significantly less attention than its continuous counterpart. On the other hand, cell sizes of many realistic libraries are sparse, for example, geometrically spaced, which makes the nearest rounding approach inapplicable as large timing violations may be introduced. Therefore, it is highly desirable to design an effective algorithm to handle this discrete gate-sizing problem. Such an algorithm is proposed in this paper. The algorithm is a continuous-solution- guided dynamic-programming-like approach. A set of novel techniques, such as locality-sensitive-hashing-based solution pruning, is also proposed to accelerate the algorithm. Our experimental results demonstrate that 1) the nearest rounding approach often leads to large timing violations and 2) compared to the well-known Coudert's approach, the new algorithm saves up to 21% in area cost while still satisfying the timing constraint. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/336086
ISSN
2023 Impact Factor: 2.7
2023 SCImago Journal Rankings: 0.957

 

DC FieldValueLanguage
dc.contributor.authorHu, Shiyan-
dc.contributor.authorKetkar, Mahesh-
dc.contributor.authorHu, Jiang-
dc.date.accessioned2024-01-15T08:23:18Z-
dc.date.available2024-01-15T08:23:18Z-
dc.date.issued2009-
dc.identifier.citationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2009, v. 28, n. 1, p. 818-825-
dc.identifier.issn0278-0070-
dc.identifier.urihttp://hdl.handle.net/10722/336086-
dc.description.abstractWith increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shift, the problem of discrete gate sizing has received significantly less attention than its continuous counterpart. On the other hand, cell sizes of many realistic libraries are sparse, for example, geometrically spaced, which makes the nearest rounding approach inapplicable as large timing violations may be introduced. Therefore, it is highly desirable to design an effective algorithm to handle this discrete gate-sizing problem. Such an algorithm is proposed in this paper. The algorithm is a continuous-solution- guided dynamic-programming-like approach. A set of novel techniques, such as locality-sensitive-hashing-based solution pruning, is also proposed to accelerate the algorithm. Our experimental results demonstrate that 1) the nearest rounding approach often leads to large timing violations and 2) compared to the well-known Coudert's approach, the new algorithm saves up to 21% in area cost while still satisfying the timing constraint. © 2009 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems-
dc.subjectDiscretization-
dc.subjectDynamic programming (DP)-
dc.subjectGate sizing-
dc.subjectPruning-
dc.subjectSparse cell library-
dc.titleGate sizing for cell-library-based designs-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-77955191978-
dc.identifier.volume28-
dc.identifier.issue1-
dc.identifier.spage818-
dc.identifier.epage825-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats