1
Views
0
CrossRef citations to date
0
Altmetric
Note

Printed Circuit Board Routing: A Survey

Pages 494-499 | Received 20 Jun 1979, Published online: 11 Jul 2015

REFERENCES

  • Hightower (D). The Interconnection Problem: A Tutorial. Computer. 7, 4; 1974, 18–32.
  • Breuer (M A). Design Automation of Digital Systems. Prentice-Hall, N.J., 1972, Vol. 1.
  • Bose (N K). Automated Routing of Large-Scale Circuits. Journal of the Institution of Electronics and Telecommunication Engineers. 23, 7; 1977: 407–412.
  • Lee (C). An Algorithm for Path Connections and its Applications. IRE Trans, on Electronic Computers (September 1961), 346–365.
  • Moore (E F). Shortest Path through a Maze. Harvard University Press. Cambridge, Mass. Vol. 30, 1959, 285–292.
  • Aramaki (I) et al. Automation of Etching-Pattern Lavout. CACM. 14, 11; 1971; 720–730.
  • Mikami (K) and Tabuchi (K). A Computer Program for Optimal Routing of Printed Circuit Connectors. IFIPS Proc., 1972. 1475–1478.
  • Hitchcock (R). Cellular Wiring and the Cellular Modelling Technique. Proc. 6th Design Automation Workshop. 1969, 25–41.
  • Hashimoto (A) and Stevens (J). Wire Routing by Optimising Channel Assignment within Large Apertures. Proc. 6th Design Automation Workshop (1969), 155–169.
  • Rubin (F). The Lee Path Connection Algorithm. IEEE Trans. C-23, Sept. 1974; 907–914.
  • Hoel (J H). Some Variations of Lee's Algorithm. IEEE Trans. C-25, 1; 1976; 19–24.
  • Hoel (J H). Correction to the Lee Path Connection Algorithm. IEEE Trans. C-25, 1, 1976; 208.
  • Yang (Y Y) and Wing (O). Suboptimal Algorithm for a Wire Routing Problem. IEEE Trans. CT-19, 5; 1972; 508–510.
  • Yang (Y Y) and Wing (O). On a Multi-net Wiring Problem, received through private communication, 1972.
  • Bose (N K) et al. Use of Steiner's Problem in Sub-optimal Routing in Rectilinear Metric. IEEE Trans. CAS-23, 7; 1976; 470–476.
  • Alia (G), Fronsini (G) and Masstrini (P). Automated Module Placement and Wire Routing According to a Structured Biplanar Scheme in Printed Boards. Computer Aided Design. 5, 3; 1973; 169–174.
  • Hosking (K S). Automatic Printed Circuit Board Routing with Intermediate Control of the Tracking. Computer Aided Design. 8, 3; 1976; 149–156.
  • Asano (T) et al. A Wire Routing Scheme Based on Trunk Division Methods. IEEE Trans. C-26, 8; 1977: 764–771.
  • Wu (W) and Douglas (D C). A Floating via Router Based on a Saturated Zone Strategy. IEEE Trans. CAS-23, 12; 1976; 830–835.
  • Mah (L) and Steinberg (L). Topological Class Routing for Printed Circuit Boards. Proc. 9th Design Automation Workshop 1972, P 80–93.
  • Kuh (E S) et al. The Multilayer Routing Problem, Algorithm and Necessary and Sufficient Conditions for the Single Row Single Layer Case. IEEE Trans. CAS-23, 12; 1976; 768–777.
  • Pal Chaudhuri (P). An Ecological Approach to Wire Routing. 1979 IEEE International Symposium on Circuits and Systems, July 17–19, Tokyo.
  • Pal Chaudhuri (P). Routing Multilayer Boards on Steiner Metric. 1980 IEEE International Symposium on Circuits and Systems, April 28–30 Houston.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.