Fast printed circuit board routing

Authors:
J. Dion
Affiliations:
Digital Equipment Corporation Western Research Laboratory, 100 Hamilton Avenue, Palo Alto, CA
Venue:
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Year:
1987

Citing 7
Cited 1

Automation of etching-pattern layout

Communications of the ACM
A global routing algorithm for general cells

DAC '84 Proceedings of the 21st 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 solution to line-routing problems on the continuous plane

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

DAC '82 Proceedings of the 19th Design Automation Conference
An efficient variable-cost maze router

DAC '82 Proceedings of the 19th Design Automation Conference
Automated rip-up and reroute techniques

DAC '82 Proceedings of the 19th Design Automation Conference

Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT

FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the algorithms in a printed circuit board router used for fully automatic routing of high-density circuit boards. Completely automatic routing and running times of a few minutes have resulted from a new data structure for efficient representation of the routing grid, quick searches for optimal solutions, and generalizations of Lee's algorithm.