Advances in PCB Routing

• Yan Tan

  Synopsys, Inc.

• Ma Qiang

  University of Illinois at Urbana-Champaign

• Wong Martin D.F.

  University of Illinois at Urbana-Champaign

抄録

The increasing complexity of electronic systems has made PCB routing a difficult problem. A large amount of research effort has been dedicated to the study of this problem. In this paper, we provide an overview of recent research results on the PCB routing problem. We focus on the escape routing problem and the length-matching routing problem, which are the two most important problems in PCB routing. Other relevant works are also briefly introduced.

収録刊行物

• Information and Media Technologies

  Information and Media Technologies 7 (2), 535-543, 2012

  Information and Media Technologies 編集運営会議

キーワード

• PCB routing
• escape routing
• length-matching routing
• network-flow

詳細情報

• CRID: 1390001205264673024
• NII論文ID: 130002073579
• DOI: 10.11185/imt.7.535
• ISSN: 18810896
• 本文言語コード: en
• データソース種別:
  • JaLC
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可