Minimum area joining of compacted cells

We consider the problem of joining a row of compacted cells so as to minimize the area occupied by the cells and the interconnects. The cell joining process includes cell stretching and river routing. We propose several heuristics to join a row of cells in such a way that area is minimized. The proposed heuristics are compared, experimentally with that proposed by Cheng and Despain (1989). >

[1]  Sartaj Sahni,et al.  Optimal Joining of Compacted Cells , 1993, IEEE Trans. Computers.

[2]  Martin Tompa.  An Optimal Solution to a Wire-Routing Problem , 1981, J. Comput. Syst. Sci..

[3]  Franco P. Preparata,et al.  Optimal Three-Layer Channel Routing , 1984, IEEE Transactions on Computers.

[4]  Ron Y. Pinter,et al.  On Routing Two-Point Nets Across a Channel , 1982, 19th Design Automation Conference.

[5]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[6]  Ron Y. Pinter,et al.  River Routing: Methodology and Analysis , 1983 .

[7]  Ellis Horowitz,et al.  Fund of Data Structures Pascal: II , 1994 .

[8]  David G. Boyer.  Symbolic layout compaction review , 1988, DAC '88.

[9]  Ron Y. Pinter,et al.  Optimal Placement for River Routing , 1983 .

[10]  Andranik Mirzaian,et al.  River Routing in VLSI , 1987, J. Comput. Syst. Sci..

[11]  Neil Weste.  Virtual grid symbolic layout , 1981, DAC '81.

[12]  Chuck Radke.  15th design automation conference report-Dac'78 , 1978, SIGD.