DocumentCode
848818
Title
A pin permutation algorithm for improving over-the-cell channel routing
Author
Chen, C. Y Roger ; Hou, Cliff Yungchin
Author_Institution
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
Volume
14
Issue
8
fYear
1995
fDate
8/1/1995 12:00:00 AM
Firstpage
1030
Lastpage
1037
Abstract
In standard cell design, some of the cell terminals and gates are permutable. Therefore, it is important for an over-the-cell channel router to take advantage of this so as to obtain better results. A greedy 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 maximal channel density can be greatly reduced. Experimental results show that our proposed algorithm indeed considerably reduces the maximal channel density
Keywords
VLSI; cellular arrays; circuit layout CAD; integrated circuit layout; logic CAD; network routing; gate positions; greedy algorithm; maximal channel density; over-the-cell channel routing; pin permutation algorithm; standard cell design; terminal positions; Computer applications; Greedy algorithms; Polynomials; Routing; Software engineering; Terminology; Very large scale integration;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.402506
Filename
402506
Link To Document