• DocumentCode
    3150042
  • Title

    The Channel Expansion Problem in Layout Design

  • Author

    Chen, R.R. ; Kajitani, Y.

  • Author_Institution
    Dept. of Elec. Engr., San Jose State University, San Jose, CA
  • fYear
    1984
  • fDate
    25-27 June 1984
  • Firstpage
    388
  • Lastpage
    391
  • Abstract
    In order to develop an efficient method of routing channels in the layout design process, an algorithm which solves the channel expansion problem is presented. This algorithm guarantees the minimum number of rerouted channels with respect to a single channel in a given placement. In addition, examples are given to illustrate various aspects of the algorithm.
  • Keywords
    Algorithm design and analysis; Costs; Design automation; Process design; Routing; Switches;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation, 1984. 21st Conference on
  • ISSN
    0738-100X
  • Print_ISBN
    0-8186-0542-1
  • Type

    conf

  • DOI
    10.1109/DAC.1984.1585826
  • Filename
    1585826
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3150042