DocumentCode
3258043
Title
A pin permutation algorithm for improving over-the-cell channel routing
Author
Hou, Cliff Yungchin ; Chen, C. Y Roger
Author_Institution
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
fYear
1992
fDate
8-12 Jun 1992
Firstpage
594
Lastpage
599
Abstract
A dynamic-programming-based algorithm is presented to determine proper gate and terminal positions such that, when over-the-cell routers are used, the area above and below the channel can be utilized more effectively and the channel density can be greatly reduced. The problem formulation and previous work are discussed. The terminology and notation are introduced. A polynomial-time algorithm is presented. Experimental results showed that the proposed algorithm considerably reduces the channel density
Keywords
circuit layout CAD; computational complexity; dynamic programming; network routing; channel routing; dynamic-programming; over-the-cell; pin permutation algorithm; polynomial-time algorithm; Algorithm design and analysis; Design automation; Polynomials; Routing; Terminology; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 1992. Proceedings., 29th ACM/IEEE
Conference_Location
Anaheim, CA
ISSN
0738-100X
Print_ISBN
0-8186-2822-7
Type
conf
DOI
10.1109/DAC.1992.227816
Filename
227816
Link To Document