A length matching routing method for disordered pins in PCB design

Ran Zhang, Tieyuan Pan, Li Zhu, Takahiro Watanabe

研究成果: Conference contribution

3 引用 (Scopus)

抜粋

In this paper, for the disordered pins in printed circuit board (PCB) design, a heuristics algorithm is proposed to obtain a length matching routing. We initially check the longest common subsequence of pin pairs to assign layers for pins. Then, adopt single commodity flow to generate base routes. R-flip and C-flip are finally carried out to adjust the wire length. The experiments show that our algorithm generates the optimal routes with better wire balance within reasonable CPU times.

元の言語English
ホスト出版物のタイトル20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015
出版者Institute of Electrical and Electronics Engineers Inc.
ページ402-407
ページ数6
ISBN(印刷物)9781479977925
DOI
出版物ステータスPublished - 2015 3 11
イベント2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015 - Chiba, Japan
継続期間: 2015 1 192015 1 22

Other

Other2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015
Japan
Chiba
期間15/1/1915/1/22

ASJC Scopus subject areas

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

フィンガープリント A length matching routing method for disordered pins in PCB design' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Zhang, R., Pan, T., Zhu, L., & Watanabe, T. (2015). A length matching routing method for disordered pins in PCB design. : 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015 (pp. 402-407). [7059038] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASPDAC.2015.7059038