Advanced search
Publication Cover
IETE Journal of Research Volume 24, 1978 - Issue 3-4
Submit an article Journal homepage
4
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Automated Routing of Printed Circuit Boards

K. G. KulkarniComputer-Aided Design Group, Indian Telephone Industries Limited, Bangalore560 016.
&
A. PrabhakarComputer-Aided Design Group, Indian Telephone Industries Limited, Bangalore560 016.
Pages 158-163 | Published online: 11 Jul 2015

REFERENCES

  • Lin (S). Computer Solutions of the Travelling Salesman Problem. BSTJ. 44; 1965; 2245–2269.
  • Loberman (A) and Weinberger (A). Formal Procedures for Connecting Terminals with a Minimum Total Wire Length. J. ACM. 4, 10; 1957; 428–437.
  • Prim (R C). Shortest Connection Networks and Some Generalizations. BSTJ. 36, 1957; 1389–1401.
  • Hanan (M). On Steiner's Problem with Rectilinear Distance. SIAM J. of App. Math. 14, 2; 1966; 255–265.
  • Gilbert (E N) and Pollack (H O). Steiner Minimal Trees. SIAM J. of App. Math. 16, 1; 1968; 1–29.
  • Lee (J H), Bose (N K) and Hwang (F K). Use of Steiner's Problem in Suboptimal Routing in Rectilinear Metric. IEEE Trans. CAS-23, 7; 1976; 470–476.
  • Abel (L). On the Automated Layout of Multilayer Planar Wiring and a Related Graph Coloring Problem. Coordinated Science Lab. Report. R-54. Univ. of Illinois. 1972.
  • Rubin (F). Assigning Wires to Layers of a Printed Circuit Board. Proc. Des. Auto. Workshop. 1973; 22–32.
  • Akers (S B). Routing. Chap 6 in Design Automation of Digital Systems: Theory and Techniques. Vol 1. Ed. Breuer (M A). Prentice Hall. 1972.
  • Hightower (D W). The Interconnection Problem—A Tutorial. Computer. 7, 4; 1974; 18–32.
  • Kulkarni (K.G) and Jayakumar (V). Ordering of Con nections for Automated Routing. Presented in CSI-76, 1976.
  • Lee (C). An Algorithm for Path Connections and Its Applications. IRE Trans. EC-10; 1961; 346–365.
  • Akers (S B). A Modification of Lee's Path Connection Algorithm. IEEE Trans. EC-16, 1; 1967; 97–98.
  • Mikami (K) and Tabuchi (K). A Computer Program for Optimal Routing of Printed Circuit Conductors. IFIPS Proc. 1968. 1475–1478.
  • Geyer (J M). Connector Routing Algorithm for Printed Circuit Boards. IEEE Trans. CT-18, 1; 1971; 95–100.
  • Hitchcock (R B). Cellular Wiring and the Cellular Model ling Technique. Proc. Des. Auto. Workshop. 1969; 25–41.
  • Lass (S E). Automated Printed Circuit Routing with a Stepping Aperture. Comm. ACM. 12, 5; 1969; 262–265.
  • Hashimoto (A) and Stevens (J). Wire Routing by Opti mized Channel Assignment with Large Apertures. Proc. Des. Auto. Workshop. 1971; 155–169.
  • Wu (W) and Schmidt (D C). A Floating Via Router Based on a Saturated Zone Strategy. IEEE Trans. CAS-23, 12; 1976; 829–835.
  • Hightower (D). A Solution to Line Routing Problems on the Continuous Plane. Proc. Des. Auto. Workshop. 1969; 1–24.
  • Kodres (U R). Formulations and Solutions of Circuit Card Design Problems Through Use of Graph Methods. Advances in Electronic Packaging. Vol 2. 1961; 121–162.
  • Van Cleemput (W M). Mathematical Models for the Cir cuit Layout Problem. IEEE Trans. CAS-23, 12; 1976; 759–767.
  • Bose (N K). Automated Routing of Large-Scale Circuits. J. IETE. 23, 7; 1977; 407–412.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.