This Article 
 Bibliographic References 
 Add to: 
Maximum Alignment of Interchangeable Terminals
October 1988 (vol. 37 no. 10)
pp. 1166-1177
The authors develop a linear algorithm to maximize the number of terminals aligned across a routing channel. It is assumed that the terminals in the cells on either side of the channel are interchangeable. This algorithm has application to the routing of PLAs and other circuits with interchangeable terminals.

[1] D. N. Deutsch, "A dogleg channel router," inProc. 20th Design Automat. Conf., 1976, pp. 425-433.
[2] R.L. Rivest and C. M. Fiduccia, "A 'greedy' channel router," inProc. 19th Design Automat. Conf., 1982, pp. 418-424.
[3] T. Yoshimura and E. S. Kuh, "Efficient algorithms for channel routing,"IEEE Trans. Comput.-Aided Design, vol. CAD-1, no. 1, pp. 25-35, 1982.
[4] M. Burstein and R. Pelavin, "Hierarchical wire routing,"IEEE Trans. Comput.-Aided Design Integrated Circuits Syst., vol. CAD- 2, pp. 223-234, Oct. 1983.
[5] H. Kobayashi and C. E. Drozd, "Efficient algorithms for routing interchangeable terminals,"IEEE Trans. Comput.-Aided Design Integrated Circuits Syst., vol. CAD-4, pp. 204-207, 1985.

Index Terms:
maximum alignment; interchangeable terminals; linear algorithm; routing channel; PLAs; circuit layout CAD; logic arrays; logic CAD.
L.-S. Lin, S. Sahni, "Maximum Alignment of Interchangeable Terminals," IEEE Transactions on Computers, vol. 37, no. 10, pp. 1166-1177, Oct. 1988, doi:10.1109/12.5978
Usage of this product signifies your acceptance of the Terms of Use.