This Article 
 Bibliographic References 
 Add to: 
Optimal Joining of Compacted Cells
May 1993 (vol. 42 no. 5)
pp. 597-607

Three algorithms to join two compacted cells by using a combination of stretching and river routing are developed. Each of these obtains the minimum area joining. One algorithm obtains a minimum area joining that also minimizes the length of the longest wire. Another obtains a minimum area joining that has the least possible total wire length. The simplest of the algorithms guarantees only a minimum are joining. All algorithms have a low-order polynomial complexity. Experimental results indicate that the algorithms obtain joinings that are significantly superior to those obtained using the heuristic of G. Cheng and A. Despain (1989).

[1] D. Boyer, "Symbolic Layout Compaction Review,"Proc. Design Automation Conf., IEEE Computer Society Press, Los Alamitos, Calif., 1988, pp. 383-389.
[2] G. Cheng and A. Despain, "Fang: A joiner for compacted cells," inProc. VLSI 89, 1989, pp. 455-463.
[3] E. Horowitz and S. Sahni,Fundamentals of Data Structures in Pascal, 3rd Ed. Rockville, MD: Computer Science Press, 1990.
[4] C. Leiserson and R. Pinter, "Optimal placement for river routing,"SIAM J. Comput., pp. 447-462, 1983.
[5] A. Lim and S. Sahni, "Segmented winner tree," inProc. 30th Annu. ACM Southeastern Conf., 1992.
[6] A. Mirzaian, "River routing in VLSI,"J. Comput. Syst. Sci., vol. 34, no. 1, pp. 43-54, 1987.
[7] R. Pinter, "On routing two point nets across a channel," inProc. ACM/IEEE Design Automat. Conf., 1982, pp. 899-902.
[8] R. Pinter, "River-routing: Methodology and analysis," inProc. Third Caltech Conf. VLSI, Mar. 1983.
[9] N. Weste, "Virtual Grid Symbolic Layout,"Proc. Design Automation Conf., IEEE Computer Society Press, Los Alamitos, Calif., 1981, pp. 225-233.

Index Terms:
compacted cells; stretching; river routing; minimum area joining; wire length; low-order polynomial complexity; circuit layout CAD; network routing; VLSI.
A. Lim, S.-W. Cheng, S. Sahni, "Optimal Joining of Compacted Cells," IEEE Transactions on Computers, vol. 42, no. 5, pp. 597-607, May 1993, doi:10.1109/12.223679
Usage of this product signifies your acceptance of the Terms of Use.