Topologic class routing for printed circuit boards

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Topologic class routing for printed circuit boards

Full text

Pdf (490 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 9th Design Automation Workshop table of contents

Pages: 80 - 93

Year of Publication: 1972

Authors

L. Mah
L. Steinberg

Sponsors

IEEE : Institute of Electrical and Electronics Engineers
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 1, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800153.804933 What is a DOI?

ABSTRACT

A routing procedure is given which is different from Lee type algorithms in that it considers a large group of interconnections simultaneously. A finite number of path classes are established and an algorithm is given for finding the maximum number of non-intersecting interconnections which can be routed if the paths are restricted to these classes. Procedures are given for drawing all interconnections which have been assigned to some path class.

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	C. Y. Lee, "An Algorithm for Path Connection and Its Applications", IRE Transactions on Electronic Computers, Vol. EC-10, (Sept.1961), pp. 346-365.
	2	R. B. Hitchcock, Cellular wiring and the cellular modeling technique, Proceedings of the 6th annual conference on Design Automation, p.25-41, January 1969 [doi>10.1145/800260.809015]
	3	Stanley E. Lass, Automated printed circuit routing with a stepping aperture, Communications of the ACM, v.12 n.5, p.262-265, May 1969 [doi>10.1145/362946.362973]
	4	Akihiro Hashimoto , James Stevens, Wire routing by optimizing channel assignment within large apertures, Proceedings of the 8th workshop on Design automation, p.155-169, June 28-30, 1971, Atlantic City, New Jersey, United States [doi>10.1145/800158.805069]
	5	Claude Berge, Theory of Graphs and Its Applications, Wiley, 1962.

CITED BY 6

	James A. Smith , James G. Linders, Automatic generation of logic diagrams, Proceedings of the 13th conference on Design automation, p.377-391, June 28-30, 1976, San Francisco, California, United States
	David W. Hightower, The interconnection problem - a tutorial, Proceedings of the 10th workshop on Design automation, p.1-21, June 25-27, 1973
	B. Ramakrishna Rau, A new philosophy for interconnection on multilayer boards, Proceedings of the 13th conference on Design automation, p.225-231, June 28-30, 1976, San Francisco, California, United States
	Norman L. Koren, Pin assignment in automated printed circuit board design, Proceedings of the 9th workshop on Design automation, p.72-79, June 26-28, 1972
	W. M. vanCleemput, On the topological aspects of the circuit layout problem, Proceedings of the 13th conference on Design automation, p.441-450, June 28-30, 1976, San Francisco, California, United States
	Ivan R. Dobes, A multi-contouring algorithm, ACM SIGDA Newsletter, v.7 n.2, p.2-11, June 1977