A length matching routing method for disordered pins in PCB design

Ran Zhang, Tieyuan Pan, Li Zhu, Takahiro Watanabe

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

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages402-407
Number of pages6
ISBN (Print)9781479977925
DOIs
Publication statusPublished - 2015 Mar 11
Event2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015 - Chiba, Japan
Duration: 2015 Jan 192015 Jan 22

Other

Other2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015
CountryJapan
CityChiba
Period15/1/1915/1/22

Fingerprint

Printed Circuit Board
Flip
Printed circuit boards
Routing
Wire
Longest Common Subsequence
Heuristic algorithms
CPU Time
Heuristic algorithm
Program processors
Assign
Experiment
Experiments
Design

ASJC Scopus subject areas

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

Cite this

Zhang, R., Pan, T., Zhu, L., & Watanabe, T. (2015). A length matching routing method for disordered pins in PCB design. In 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

A length matching routing method for disordered pins in PCB design. / Zhang, Ran; Pan, Tieyuan; Zhu, Li; Watanabe, Takahiro.

20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 402-407 7059038.

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

Zhang, R, Pan, T, Zhu, L & Watanabe, T 2015, A length matching routing method for disordered pins in PCB design. in 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015., 7059038, Institute of Electrical and Electronics Engineers Inc., pp. 402-407, 2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015, Chiba, Japan, 15/1/19. https://doi.org/10.1109/ASPDAC.2015.7059038
Zhang R, Pan T, Zhu L, Watanabe T. A length matching routing method for disordered pins in PCB design. In 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 402-407. 7059038 https://doi.org/10.1109/ASPDAC.2015.7059038
Zhang, Ran ; Pan, Tieyuan ; Zhu, Li ; Watanabe, Takahiro. / A length matching routing method for disordered pins in PCB design. 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 402-407
@inproceedings{a8900dc066ba44aa8477e3ee675bef31,
title = "A length matching routing method for disordered pins in PCB design",
abstract = "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.",
author = "Ran Zhang and Tieyuan Pan and Li Zhu and Takahiro Watanabe",
year = "2015",
month = "3",
day = "11",
doi = "10.1109/ASPDAC.2015.7059038",
language = "English",
isbn = "9781479977925",
pages = "402--407",
booktitle = "20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A length matching routing method for disordered pins in PCB design

AU - Zhang, Ran

AU - Pan, Tieyuan

AU - Zhu, Li

AU - Watanabe, Takahiro

PY - 2015/3/11

Y1 - 2015/3/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84926469169&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926469169&partnerID=8YFLogxK

U2 - 10.1109/ASPDAC.2015.7059038

DO - 10.1109/ASPDAC.2015.7059038

M3 - Conference contribution

SN - 9781479977925

SP - 402

EP - 407

BT - 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -