Issue No. 12 - December (1990 vol. 39)

ISSN: 0018-9340

pp: 1446-1455

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.61064

ABSTRACT

<p>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.</p>

INDEX TERMS

VLSI; multiple ripple propagation technique; mapping; dilation two property; circuit layout CAD; VLSI.

CITATION

R.G. Melhem, G.-Y. Hwang, "Embedding Rectangular Grids into Square Grids with Dilation Two",

*IEEE Transactions on Computers*, vol. 39, no. , pp. 1446-1455, December 1990, doi:10.1109/12.61064