ACM Home Page
Please provide us with feedback. Feedback
Automated printed circuit routing with a stepping aperture
Full text PdfPdf (555 KB)
Source
Communications of the ACM archive
Volume 12 ,  Issue 5  (May 1969) table of contents
Pages: 262 - 265  
Year of Publication: 1969
ISSN:0001-0782
Author
Stanley E. Lass  Scientific Data Systems, El Sequndo, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 15,   Citation Count: 14
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/362946.362973
What is a DOI?

ABSTRACT

A computer program for routing interconnections on a two-sided printed circuit board with a regular pattern of lines, pins (terminals), and vias (feed-through holes) is described. In this program, each interconnection is given a planned routing—typically, down from the upper pin, through a via, and horizontally to the lower pin. From the top, a virtual aperture (i.e. a long horizontal slit) is stepped down the board. The planned routing is the basis for rerouting interconnections within the aperture to resolve conflicts for lines and vias below the aperture and to maximize the effective line usage. If a conflict has not been resolved before the aperture arrives at the lower pin, interconnections are deleted to resolve the conflict. Extensions of this technique to the control of crosstalk between routed interconnections and to the problem of obtaining 100 percent interconnect are also discussed.


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
LEE, C.Y. An algorithm for path connections and its applications. IEEE Trans. EC-IO (Sept. 1961).
 
2
PICXRELL, W. E. An automated interconnect design system. Proc. AFIPS 1965 Fall Joint Comput. Conf., Vol. 27, Pt. 2, Spartan Books, New York, pp. 1087-1092.
3

CITED BY  14