Advertisement

On the layering problem of multilayer PWB wiring

  • S. Tsukiyama
  • E. S. Kuh
  • I. Shirakawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 108)

Abstract

This paper deals with the layering problem of multilayer PWB wiring, associated with single-row routing. The problem to be considered is restricted to the special case of street capacities up to two in each layer, and it is reduced to a problem of the interval graph by relaxing some restrictions in the original problem. Then, a heuristic algorithm is proposed for this problem.

Keywords

Equivalence Class Maximum Density Interval Graph Vertical Line Segment Horizontal Line Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    H.C.So, "Some theoretical results on the routing of multilayer printed wiring boards," Proc. IEEE ISCAS, pp. 296–303, 1974.Google Scholar
  2. [2]
    B.S. Ting, E.S. Kuh, and I. Shirakawa, "The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row single-layer case," IEEE Trans. CAS, vol. CAS-23, no. 12, pp. 768–778, 1976.Google Scholar
  3. [3]
    E.S. Kuh, T. Kashiwabara, and T. Fujisawa, "On optimum single-row routing," IEEE Trans. CAS, vol. CAS-26, no. 6, pp. 361–368, 1979.Google Scholar
  4. [4]
    S. Tsukiyama, E.S. Kuh, and I. Shirakawa, "An algorithm for single-row routing with prescribed street congestions," IEEE Trans. CAS, vol. CAS-27, no. 9, pp. 765–772, 1980.Google Scholar
  5. [5]
    B.S.Ting and E.S.Kuh, "An approach to the routing of multilayer printed circuit boards," Proc. IEEE ISCAS, pp. 907–911, 1978.Google Scholar
  6. [6]
    M.T.Doreau and L.C.Abel, "A topological based nonminimum distance routing algorithm," Proc. 15th Design Automation Conf., pp. 92–99, 1978.Google Scholar
  7. [7]
    S.Asahara, Y.Ogura, M.Odani, I.Shirakawa, and H.Ozaki, "An automatic layout system based on single-row routing for multilayer printed wiring boards," Monograph CAS 79-74, IECE Japan, pp. 79–86, 1979 (in Japanese), also, Proc. IEEE ICCC, pp. 290–294, 1980.Google Scholar
  8. [8]
    B.S. Ting, E.S. Kuh, and A. Sangiovanni-Vincentelli, "Vias assignment problem in multilayer printed circuit board," IEEE Trans. CAS, vol. CAS-26, no. 4, pp. 261–272, 1979.Google Scholar
  9. [9]
    S. Tsukiyama, I. Shirakawa, and S. Asahara, "An algorithm for the via assignment problem in multilayer backboard wiring," IEEE Trans. CAS, vol. CAS-26, no. 6, pp. 369–377, 1979.Google Scholar
  10. [10]
    M.R. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, N.Y., 1980.Google Scholar
  11. [11]
    R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, N.Y., pp. 85–103, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • S. Tsukiyama
    • 1
  • E. S. Kuh
    • 2
  • I. Shirakawa
    • 1
  1. 1.Department of Electronic EngineeringFaculty of Engineering Osaka University, SuitaOsakaJapan
  2. 2.Department of Electrical Engineering and Computer Sciences and Electronics Research LaboratoryUniversity of CaliforniaBerkeleyUSA

Personalised recommendations