VLSI Design

VLSI Design / 1994 / Article
Special Issue

Optimization in VLSI Synthesis and Layout

View this Special Issue

Open Access

Volume 2 |Article ID 068279 | https://doi.org/10.1155/1994/68279

Yang Cai, D. F. Wong, Jason Cong, "Channel Density Minimization by Pin Permutation", VLSI Design, vol. 2, Article ID 068279, 13 pages, 1994. https://doi.org/10.1155/1994/68279

Channel Density Minimization by Pin Permutation


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.

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Order printed copiesOrder

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.