• DocumentCode
    2776895
  • Title

    Clock routing for high-performance ICs

  • Author

    Jackson, Michael A B ; Srinivasan, Arvind ; Kuh, E.S.

  • Author_Institution
    Electron. Res. Lab., California Univ., Berkeley, CA, USA
  • fYear
    1990
  • fDate
    24-28 Jun 1990
  • Firstpage
    573
  • Lastpage
    579
  • Abstract
    Routing techniques for optimizing clock signals in small-cell (e.g., standard-cell, sea-of-gate, etc.) application-specific ICs (ASICs) are addressed. In previously reported works, the routing of a clock net has been performed using ordinary global routing techniques based on a minimum spanning or minimal Steiner tree that have little understanding of clock-routing problems. The authors present a novel approach to the clock-routing that all but eliminates clock skew and yields excellent phase delay results for a wide range of chip sizes, net sizes (pin count), minimum feature sizes, and pin distributions on both randomly created and standard industrial benchmarks. For certain classes of pin distributions a decrease in skew with an increase in net size was proven theoretically and observed experimentally. A two to three order magnitude reduction in skew when compared to a minimum rectilinear spanning tree was observed
  • Keywords
    application specific integrated circuits; circuit layout CAD; application-specific ICs; benchmarks; chip sizes; clock routing; clock skew; high-performance ICs; minimum feature sizes; minimum rectilinear spanning tree; net sizes; phase delay; pin distributions; Automata; Clocks; Consumer electronics; Costs; Delay; Laboratories; Logic; Routing; Time to market; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 1990. Proceedings., 27th ACM/IEEE
  • Conference_Location
    Orlando, FL
  • ISSN
    0738-100X
  • Print_ISBN
    0-89791-363-9
  • Type

    conf

  • DOI
    10.1109/DAC.1990.114920
  • Filename
    114920