Channel Density Minimization by Pin Permutation. Issue 2 (1994)

• Record Type: Journal Article
• Authors: Cai, Yang; Wong, D. F.; Cong, Jason
• Is Part Of: VLSI design. Volume 2:Issue 2(1994)
• Page Start: 171
• Page End: 183
• Publication Date: 1994
• Subjects: VLSI -- Circuit layout -- Channel routing -- Pin permutation -- Pin assignment; Integrated circuits -- Very large scale integration -- Periodicals; 621.395
• DOI: 10.1155/1994/68279
• Languages: English
• ISSNs: 1065-514X

Abstract

Abstract : We present in this paper a linear time optimal algorithm for minimizing the density of a channel (with exits) by permuting the terminals on the two sides of the channel. This compares favorably with the previously known near-optimal algorithm presented in [6] that runs in superlinear time. Our algorithm has important applications in hierarchical layout design of intergrated circuits. We also show that the problem of minimizing wire length by permuting terminals is NP-hard in the strong sense.