Issue No. 05 - May (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.223679
<p> 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).</p>
compacted cells; stretching; river routing; minimum area joining; wire length; low-order polynomial complexity; circuit layout CAD; network routing; VLSI.
S.-W. Cheng, S. Sahni, A. Lim, "Optimal Joining of Compacted Cells", IEEE Transactions on Computers, vol. 42, no. , pp. 597-607, May 1993, doi:10.1109/12.223679