ACM Home Page
Please provide us with feedback. Feedback
Fast printed circuit board routing
Full text PdfPdf (930 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 24th ACM/IEEE Design Automation Conference table of contents
Miami Beach, Florida, United States
Pages: 727 - 734  
Year of Publication: 1987
ISBN:0-8186-0781-5
Author
J. Dion  Digital Equipment Corporation Western Research Laboratory, 100 Hamilton Avenue, Palo Alto, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 12,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/37888.38004
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Soukup J., "Circuit Layout", Proc. IEEE, Vol. 69No. 10October 1981, pp. 1281-1304.
2
 
3
 
4
Moore E.F., "The Shortest Path Through a Maze", Proc. Int. Syrup. on Switching Theory, 1959, pp. 285-292, Harvard University Press
 
5
Lee C. Y., "An Algorithm for Path Connection and its Applications", IRE Transactions on Electronic Computers,September 1961, pp. 346-365.
6
 
7
Mikami K., Tabushi K., "A Computer Program for Optimal Routing of Printed Circuit Connectors", IFIPS, 1970, pp. 1475-1478.
8
 
9
Rubin F., "The Lee Connection Algorithm", IEEE Transactions on Computers, Vol. C-23 1974, pp. 907-914.
 
10
 
11
 
12