• DocumentCode
    2474668
  • Title

    OPRON: a new approach to planar OTC routing

  • Author

    Danda, S. ; Madhwapathy, S. ; Sherwani, N. ; Sureka, A.

  • Author_Institution
    Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
  • fYear
    1995
  • fDate
    16-18 Mar 1995
  • Firstpage
    208
  • Lastpage
    211
  • Abstract
    In this paper we solve the planar over-the-cell routing problem, in which nets must have at least one terminal on the boundary. Such nets allow for nontraditional cell designs, where all terminals must be placed on the boundaries giving a degree of freedom to the cell designer. We present a dynamic programming algorithm that optimally solves this problem, in O(K2n4) time, where K is the number of tracks available over the cell for a given cell row region, and n is the number of nets to be routed
  • Keywords
    VLSI; circuit layout CAD; dynamic programming; integrated circuit layout; network routing; OPRON; VLSI layout; dynamic programming algorithm; planar OTC routing; planar over-the-cell routing; Computer science; Indium phosphide; Routing; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    VLSI, 1995. Proceedings., Fifth Great Lakes Symposium on
  • Conference_Location
    Buffalo, NY
  • ISSN
    1066-1395
  • Print_ISBN
    0-8186-7035-5
  • Type

    conf

  • DOI
    10.1109/GLSV.1995.516054
  • Filename
    516054
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2474668