On Crossing Minimization Problem

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

Volumn 17, Issue 5, 1998, Pages 406-418

  Chen, Hsiao Feng Steven ^a,b   Lee, D T ^a,c  

^a IEEE   (United States)

^b SYNOPSYS INC   (United States)

^c Northwestern University   (United States)

Author keywords

Crossing minimization; Global routing; Homotopy; Optimization; Rubber band equivalent

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; OPTIMIZATION;

CROSSING MINIMIZATION PROBLEMS (CMP);

INTEGRATED CIRCUIT LAYOUT;

EID: 0032067114     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.703928     Document Type: Article

References (15)

1. Y. Cai and D. F. Wang, "Optimal channel pin assignment," IEEE Trans. Computer-Aided Design, vol. 10, pp. 1413-1424, Nov. 1991.
2. R. C. Garden, IV and C. K. Cheng, "A global router using an efficient approximate multicommodity multiterminal flow algorithm," in Proc. 28th Design Automation Conf., 1991, pp. 316-321.
3. N. P. Chen, C. P. Hsu, E. S. Kuh, C. C. Chen, and M. Takahashi, "BBL: A building block layout system for custom chip design," in Proc. Int. Conf. Computer-Aided Design, 1983, pp. 4CM1.
4. H.-F. S. Chen, and D. T. Lee, "A faster algorithm for rubber-band equivalent transformation for planar VLSI layout," IEEE Trans. Computer- Aided Design, vol. 15, pp. 217-227, Feb. 1996.
5. H.-F. S. Chen, "Topological optimization for VLSI layout design," Ph.D. dissertation, Northwestern University, Evanston, IL, June 1997.
6. C. Chiang, M. Sarrafzadeh, and C. K. Wong, "Global routing based on Steiner minmax trees," IEEE Trans. Computer-Aided Design, vol. 9, pp. 1318-1325, Dec. 1990.
7. J. Cong, "Pin assignment with global routing for general cell designs," IEEE Trans. Computer-Aided Design, vol. 10, pp. 1401-1412, Nov. 1991.
8. W.-M. Dai, T. Asano, and E. S. Kuh, "Routing region definition and ordering scheme for building-block layout," IEEE Trans. Computer- Aided Design, vol. CAD-4, pp. 189-197, July 1985.
9. W.-M. Dai, T. Dayan, and D. Staepelaere, "Topological routing in SURF: Generating a rubber-band sketch," in Proc. 28th ACM/IEEE Design Automation Conf., 1991, pp. 45-418.
10. W.-M. Dai, M. Sato, and E. S. Kuh, "A dynamic and efficient representation of building-block layout," in Proc. 24th Design Automation Conf., 1987, pp. 376-384.
11. P. Groenveld, "On global wire ordering for macro-cell routing," in Proc. Design Automation Conf., 1989, pp. 155-160.
12. W.-C. Kao and T.-M. Parng, "Cross point assignment with global rerouting for general-architecture designs," IEEE Trans. Computer- Aided Design, vol. 14, pp. 337-348, Mar. 1995.
13. C. E. Leiserson and F. M. Maley, "Algorithms for routing and testing routability of planar VLSI layouts," in Proc. 17th Annu. ACM Symp. Theory Computing, 1985, pp. 69-78.
14. J. T. Li and M. Marek-Sadowska, "Global routing for gatearray," IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 298-307, Oct. 1984.
15. M. Marek-Sadowska and M. Sarrafzadeh, "The crossing distribution problem," IEEE Trans. Computer-Aided Design, vol. 14, pp. 423-4133, Apr. 1995.