Journal of the ACM (JACM)
Automated printed circuit routing with a stepping aperture
Communications of the ACM
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
A solution to line-routing problems on the continuous plane
DAC '69 Proceedings of the 6th annual Design Automation Conference
Cellular wiring and the cellular modeling technique
DAC '69 Proceedings of the 6th annual Design Automation Conference
An iterative technique for printed wire routing
DAC '74 Proceedings of the 11th Design Automation Workshop
A programmable printed-wiring router
DAC '74 Proceedings of the 11th Design Automation Workshop
Routing of printed circuit boards
DAC '81 Proceedings of the 18th Design Automation Conference
DAC '81 Proceedings of the 18th Design Automation Conference
Aiming at a general routing strategy
DAC '81 Proceedings of the 18th Design Automation Conference
On the layering problem of multilayer PWB wiring
DAC '81 Proceedings of the 18th Design Automation Conference
TWIGY - a topological algorithm based routing system
DAC '81 Proceedings of the 18th Design Automation Conference
An automatic routing system for high density multilayer printed wiring boards
DAC '80 Proceedings of the 17th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
| Hi-index | 0.00 |
In this paper, a unique topologically based non-minimum distance routing algorithm is presented. It offers both maximal completion rates and minimal via usage. The algorithm is based on a topological transformation of a significant subset of the PC routing problem: A broad channel encompassing a full row of DIPs and all routes within it. This transformation eliminates the need to consider detailed path shapes during routing. The routing problem is transformed into a permutation of nets. It is coupled with a backtrack search to produce a powerful routing algorithm. The search is conducted in a planar environment.