Optimal Channel Pin Assignment

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 10, Issue 11, 1991, Pages 1413-1424

  Cai, Yang ^a   Wong, D F ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; MICROPROCESSOR CHIPS--DESIGN;

BUILDING BLOCK SYSTEMS; CHANNEL PIN ASSIGNMENT; POLYNOMIAL TIME OPTIMAL ALGORITHMS; STANDARD CELL SYSTEMS;

INTEGRATED CIRCUITS, VLSI;

EID: 0026255027     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.97620     Document Type: Article

References (18)

1. M. J. Atallah and S. E. Hambrusch, “Optimal rotation problems in channel routing,” IEEE Trans. Comput., vol. C-35, pp. 223-232, 1986.
2. B. S. Baker, S. N. Bhatt, and F. T. Leighton, “An approximation algorithm for Manhattan routing,” in Proc. 1983 Symp. Theory on Computing, 1983, pp. 477-486.
3. D. Brown and R. L. Rivest, “New lower bounds for channel routing.” in Proc. CMU Conf. on VLSI Systems and Computation, 1981, pp. 178-185.
4. M. Burstein and R. Pelavin, “Hierarchical channel router,” INTEGRATION, the VLSI J., vol. 1, pp. 21-38, Jan. 1983.
5. D. N. Deutsch, “A dogleg channel router,” in Proc. 13th Design Automation Conf., 1976, pp. 425-433.
6. C. M. Fiduccia and R. L. Rivest, “A greedy channel router,” in Proc. 19th Design Automation Conf., 1982, pp. 418-424.
7. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979.
8. I. S. Gopal, D. Coppersmith, and C. K. Wong, “Optimal wiring of movable terminals,” IEEE Trans. Comput., vol. C-32, pp. 845-858, Sept. 1983.
9. A. Hashimoto and H. Stevens, “Wire routing by optimizing channel assignment within large apertures,” in Proc. 8th Design Automation Workshop, 1971. pp. 155-163.
10. H. Kobayashi and C. E. Drozd, “Efficient algorithms for routing interchangeable terminals,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 204-207, July 1985.
11. A. S. LaPaugh and R. Y. Pinter, “On minimizing channel density by lateral shifting,” in Proc. 1983 Int. Conf. on Computer-Aided Design, 1983, pp. 121-122.
12. H. W. Leong and C. L. Liu, “Permutation channel routing,” in Proc. 1985 Int. Conf Computer Design: VLSI in Computers, pp. 579-584.
13. H. W. Leong, “Routing problems in physical design of integrated circuits,” Ph.D. dissertation, Dep. Comp. Sci., Univ. of Illinois at Urbana-Champaign, Urbana, IL, 1986.
14. L.-S. Lin and S. Sahni, “Maximum alignment of interchangeable terminals,” IEEE Trans. Comput., vol. C-37, pp. 1166-1177, Oct. 1988.
15. G. Persky, “PRO-An automatic string placement program for polycell layout,” in Proc. 13th Design Automation Conf., 1976, pp. 417-424.
16. S. Sahni and S.-Y. Wu, “Two NP-hard interchangeable terminal problems,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 467-472, Apr. 1988.
17. T. G. Szymanski, “Dogleg channel routing is AT-complete,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 31-41, Jan. 1985.
18. T. Yoshimura and E. S. Kuh, “Efficient algorithms for channel routing,” IEEE Trans. Computer-Aided Design, vol. CAD-1, pp. 25-35, Jan. 1982.