Name
Abstract | ||
|---|---|---|
In standard cell de.wgn, 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 dynamic programming based algorithm M presented to determine proper gate and ierminai positions such that, when over- the-ce[l routers are used, the area above and below the channel can be utilized more effectively and the channel density can be greatly reduced. Experimental results show that our proposed algorithm indeed considerably reduces the channel density. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/DAC.1992.227816 | Anaheim, CA |
Keywords | Field | DocType |
circuit layout CAD,computational complexity,dynamic programming,network routing,channel routing,dynamic-programming,over-the-cell,pin permutation algorithm,polynomial-time algorithm | Dynamic programming,Mathematical optimization,Algorithm design,Polynomial,Computer science,Permutation,Algorithm,Communication channel,Electronic engineering,Electronic design automation,Very-large-scale integration,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
0738-100X | 978-0-89791-516-8 | 4 |
PageRank | References | Authors |
0.55 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hou, C.Y. | 1 | 4 | 0.55 |
| C. Y. R. Chen | 2 | 4 | 0.55 |