An optimal algorithm for layer assignment of bus escape routing on PCBs

Qiang Ma, Evangeline F.Y. Young, Martin D.F. Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Bus escape routing is a critical problem in modern PCB design. Due to the huge pin count and high density of the pin array, it usually requires multiple layers to route the buses without any conflict. How to assign the escape routing of buses to different layers becomes an important issue. In addition, some buses are required to be assigned on consecutive layers, which adds more difficulties to the layer assignment problem. In this paper, we propose a branch-and-bound based algorithm that optimally solves the layer assignment problem of bus escape routing. Our algorithm guarantees to produce a feasible layer assignment of the buses with a minimum number of layers. We applied our algorithm on industrial data and the experimental results validate our approach.

Original languageEnglish (US)
Title of host publication2011 48th ACM/EDAC/IEEE Design Automation Conference, DAC 2011
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Print)9781450306362
StatePublished - 2011

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0738-100X


  • Branch-and-bound
  • Escape routing
  • Optimal layer assignment

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Modeling and Simulation


Dive into the research topics of 'An optimal algorithm for layer assignment of bus escape routing on PCBs'. Together they form a unique fingerprint.

Cite this