Improving over-the-cell channel routing in standard cell design

Authors:
Xiaolin Liu;Ioannis G. Tollis
Affiliations:
Dept. of Computer Science, The Univ. of Texas at Dallas, Richardson, TX;Dept. of Computer Science, The Univ. of Texas at Dallas, Richardson, TX
Venue:
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Year:
1994

Citing 2
Cited 2

Channel density reduction by routing over the cells

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A “greedy” channel router

DAC '82 Proceedings of the 19th Design Automation Conference

Measuring routing congestion for multi-layer global routing

GLSVLSI '00 Proceedings of the 10th Great Lakes symposium on VLSI
Crosstalk Reduction in Area Routing

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first stage of over-the-cell routing in the horizontally connected vertically connected (HCVC) model is formulated as followings: Given two rows of terminals, find a planar routing to connect a subset of nets (with weights) on each row of terminals using a fixed number of tracks to maximize the total weight. This problem is called the two row fixed height planar routing (TFPR) problem [CPL93]. The complexity of the TFPR problem was unknown up to now. An approximation algorithm for the TFPR problem was presented in [CPL93]. In this paper we present a O(n2*h2) time algorithm to solve the TFPR problem optimally, where n is the number of terminals and h is the height of the standard cells. Our algorithm can be used to improve the performance of several over-the-cell channel routers including the ones in [CPL93] and [HSS93].