Wire routing by optimizing channel assignment within large apertures

Proceedings - Design Automation Conference

Volumn , Issue , 1971, Pages 155-169

  Hashimoto, Akihiro ^a   Stevens, James ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGOL (PROGRAMMING LANGUAGE); COMPUTER AIDED DESIGN;

CHANNEL ASSIGNMENT; CONTROL UNIT; DESIGN SPECIFICATION; LARGE APERTURE; ROUTING METHODS; ROUTING TECHNIQUES; TWO-LAYER; UNIVERSITY OF ILLINOIS;

PRINTED CIRCUIT BOARDS;

EID: 85050951333     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800158.805069     Document Type: Conference Paper

References (8)

1. C. Y. Lee, "An algorithm for path connections and its applications", IRE Transactions on Electronic Computers, (September 1961), 346-365.
2. D. W. Hightower, "A solution to line-routing problems on the continuous plane", Proc.1969 Design Automation Workshop,1-24.
3. K. Mikami and K. Tabuchi, "A Computer Program for Optimal Routing of Printed Circuit Conductors." Proceedings of the IFIP Congress, 1968 Vol. 2 pp. 1475.
4. R. B. Hitchcock, "Cellular wiring and the cellular modeling technique", Proc. 1969 Design Automation Workshop, 25-41.
5. S. E. Lass, "Automated printed circuit routing with a stepping aperture", Comm. of ACM, 12, No. 5, (May 1969), 262-265.
6. R P. Dilworth, "A Decomposition Theorem for Partially Ordered Sets," Ann. Math., (2) 51 (1950), 161-166.
7. A. Hashimoto and J.E. Stevens, "Path Cover of Acyclic Graphs", ILLIAC IV Document No. 239, December 24, 1970.
8. U. R. Kodres, "Formulation and solution of circuit card design problems through use of graph methods", in Advances in Electronics Circuit Packaging, Vol. 2, G. A. Walker, Ed., New York: Plenum 1962, 121-142.