A topologically based non-minimum distance routing algorithm
DAC '78 Proceedings of the 15th Design Automation Conference
Some theoretical aspects of algorithmic routing
DAC '77 Proceedings of the 14th Design Automation Conference
On Two-Dimensional Via Assignment for Single-Row Routing
IEEE Transactions on Computers
LASSIE: structure to layout for behavioral synthesis tools
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A new approach to multi-layer PCB routing with short vias
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Automated rip-up and reroute techniques
DAC '82 Proceedings of the 19th Design Automation Conference
SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
| Hi-index | 0.00 |
A two-level approach to routing is described, in which a multi-layer printed circuit board routing problem is broken down into a set of single-layer ones. A topological transformation is then applied to accomplish single-layer routing. A solution found for each layer by a search in this new domain is then translated back into physical space by means of a deterministic drawing algorithm. The algorithms are independent of specific technological parameters, affording their use on a variety of board routing grids, pad diameters and wire sizes.