• DocumentCode
    1401036
  • Title

    Embedding rectangular grids into square grids with dilation two

  • Author

    Melhem, Rami G. ; Hwang, Ghil-Young

  • Author_Institution
    Dept. of Comput. Sci., Pittsburgh Univ., PA, USA
  • Volume
    39
  • Issue
    12
  • fYear
    1990
  • fDate
    12/1/1990 12:00:00 AM
  • Firstpage
    1446
  • Lastpage
    1455
  • Abstract
    A novel technique, the multiple ripple propagation technique, is presented for mapping and h×w grid into a w ×h grid such that the dilation cost is 2, i.e. such that any two neighboring nodes in the first grid are mapped onto two nodes in the second grid that are separated by a distance of at most 2. The technique is then used as a basic tool for mapping any rectangular source grid into a square target grid with the dilation two property preserved. The ratio of the number of nodes in the source grid to the number of nodes in the target grid, called the expansion cost, is shown to be always less than 1.2. This is a significant improvement over the previously suggested techniques, where the expansion cost could be bounded by 1.2 only if the dilation cost was allowed to be as high as 18
  • Keywords
    VLSI; circuit layout CAD; VLSI; dilation two property; mapping; multiple ripple propagation technique; Circuits; Communication system control; Computer science; Costs; Hypercubes; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.61064
  • Filename
    61064