A gridless router for industrial design rules

Authors:
W. L. Schiele;Th. Krüger;K. M. Just;F. H. Kirsch
Affiliations:
Siemens AG, Semiconductor Group, HL CAD, Balanstr. 73, D-8000 Munich 80, FRG;Siemens AG, Semiconductor Group, HL CAD, Balanstr. 73, D-8000 Munich 80, FRG;Siemens AG, Semiconductor Group, HL CAD, Balanstr. 73, D-8000 Munich 80, FRG;Siemens AG, Semiconductor Group, HL CAD, Balanstr. 73, D-8000 Munich 80, FRG
Venue:
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Year:
1991

Citing 7
Cited 3

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction

Computational geometry: an introduction
Layout design and verification

Layout design and verification
Plowing: modifying cells and routing 45:9D - layouts

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A line-expansion algorithm for the general routing problem with a guaranteed solution

DAC '80 Proceedings of the 17th Design Automation Conference
A data structure for gridless routing

DAC '80 Proceedings of the 17th Design Automation Conference
A solution to line-routing problems on the continuous plane

DAC '69 Proceedings of the 6th annual Design Automation Conference

VIA design rule consideration in multi-layer maze routing algorithms

ISPD '99 Proceedings of the 1999 international symposium on Physical design
DUNE: a multi-layer gridless routing system with wire planning

ISPD '00 Proceedings of the 2000 international symposium on Physical design
An implicit connection graph maze routing algorithm for ECO routing

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

A point-to-point routing algorithm with three new features is presented. First, the router makes optimal use of oversized, rectangular contacts. Second, it allows different wire width on different layers, with the layers having complete freedom as to routing direction. These two features make the algorithm attractive for MOS layout applications. Finally it is able to realize all-angle routing and to accept all-angle obstacles, a feature interesting for hybrid and PCB routing. The router is gridless and guarantees a solution if one exists. Since it is based on computational geometry algorithms, it offers a low run-time complexity. The ideas have been implemented in a prototype version for 45° routing. The results indicate that the router performs well, even on large designs.