1993
DOI: 10.1109/43.277618
|View full text |Cite
|
Sign up to set email alerts
|

Physical models and efficient algorithms for over-the-cell routing in standard cell design

Abstract: When an over-the-cell routing layer is available for standard cell layout, efficient utilization of that routing space over the cells can significantly reduce layout area. In this paper, we present three physical models to utilize the area over the cells for routing in standard cell designs. We also present efficient algorithms to choose and to route a planar subset of nets over the cells so that the resulting channel density is reduced as much as possible. For each of the physical models, we show how to arran… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
19
0

Year Published

1995
1995
2004
2004

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(19 citation statements)
references
References 23 publications
0
19
0
Order By: Relevance
“…Our new over-the-cell (OTC) routing model is based on the HCVD model for standard cell design, as described in [6]. We assume the intra-cell connections are done in the plysilicon and the first metal (Ml) layer.…”
Section: New Physical Modelmentioning
confidence: 99%
“…Our new over-the-cell (OTC) routing model is based on the HCVD model for standard cell design, as described in [6]. We assume the intra-cell connections are done in the plysilicon and the first metal (Ml) layer.…”
Section: New Physical Modelmentioning
confidence: 99%
“…Therefore, it is possible to use the other metal layer over the cells for inter-cell routing in order to reduce the channel routing area. There are two physical models [CPL93]: routed on layer M1. The power bus is on layer M2 in the upper channel just above the upper terminals, and the ground bus is on layer M2 in the lower channel just below the lower terminals.…”
Section: Introductionmentioning
confidence: 99%
“…This problem is called the M O row fixed height planar routing (TFPR) problem [CPL93]. There were no polynomial time algorithms to solve the TFPR problem optimally before.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations