IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v105y2001i1p37-6010.1023-a1013345330079.html
   My bibliography  Save this article

VLSI Circuit Performance Optimization by Geometric Programming

Author

Listed:
  • Chris Chu
  • D.F. Wong

Abstract

Delay of VLSI circuit components can be controlled by varying their sizes. In other words, performance of VLSI circuits can be optimized by changing the sizes of the circuit components. In this paper, we define a special type of geometric program called unary geometric program. We show that under the Elmore delay model, several commonly used formulations of the circuit component sizing problem considering delay, chip area and power dissipation can be reduced to unary geometric programs. We present a greedy algorithm to solve unary geometric programs optimally and efficiently. When applied to VLSI circuit component sizing, we prove that the runtime of the greedy algorithm is linear to the number of components in the circuit. In practice, we demonstrate that our unary-geometric-program based approach for circuit sizing is hundreds of times or more faster than other approaches. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Chris Chu & D.F. Wong, 2001. "VLSI Circuit Performance Optimization by Geometric Programming," Annals of Operations Research, Springer, vol. 105(1), pages 37-60, July.
    • Handle: RePEc:spr:annopr:v:105:y:2001:i:1:p:37-60:10.1023/a:1013345330079
    DOI: 10.1023/A:1013345330079
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1013345330079
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1013345330079?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Shiang-Tai, 2006. "Posynomial geometric programming with parametric uncertainty," European Journal of Operational Research, Elsevier, vol. 168(2), pages 345-353, January.
    2. G. S. Mahapatra & T. K. Mandal, 2012. "Posynomial Parametric Geometric Programming with Interval Valued Coefficient," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 120-132, July.
    3. Rashed Khanjani Shiraz & Madjid Tavana & Debora Di Caprio & Hirofumi Fukuyama, 2016. "Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 243-265, July.
    4. Liu, Shiang-Tai, 2008. "Posynomial geometric programming with interval exponents and coefficients," European Journal of Operational Research, Elsevier, vol. 186(1), pages 17-27, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:105:y:2001:i:1:p:37-60:10.1023/a:1013345330079. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.