Advances in PCB routing

Tan Yan; Qiang Ma; Martin D.F. Wong

doi:10.2197/ipsjtsldm.5.14

Advances in PCB routing

Tan Yan^*, Qiang Ma, Martin D.F. Wong

^*Corresponding author for this work

Office of the Provost

Research output: Contribution to journal › Journal article › peer-review

13 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	14-22
Number of pages	9
Journal	IPSJ Transactions on System LSI Design Methodology
Volume	5
DOIs	https://doi.org/10.2197/ipsjtsldm.5.14
Publication status	Published - Feb 2012

Scopus Subject Areas

Computer Science Applications
Electrical and Electronic Engineering

User-Defined Keywords

Escape routing
Length-matching routing
Network-flow
PCB routing

Access to Document

10.2197/ipsjtsldm.5.14

Cite this

@article{df5b04da009f4690bbd4f921f97090c0,

title = "Advances in PCB routing",

abstract = "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.",

keywords = "Escape routing, Length-matching routing, Network-flow, PCB routing",

author = "Tan Yan and Qiang Ma and Wong, {Martin D.F.}",

note = "Publisher copyright: {\textcopyright} 2012 Information Processing Society of Japan ",

year = "2012",

month = feb,

doi = "10.2197/ipsjtsldm.5.14",

language = "English",

volume = "5",

pages = "14--22",

journal = "IPSJ Transactions on System LSI Design Methodology",

issn = "1882-6687",

publisher = "Information Processing Society of Japan",

}

TY - JOUR

T1 - Advances in PCB routing

AU - Yan, Tan

AU - Ma, Qiang

AU - Wong, Martin D.F.

PY - 2012/2

Y1 - 2012/2

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

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

KW - Escape routing

KW - Length-matching routing

KW - Network-flow

KW - PCB routing

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

U2 - 10.2197/ipsjtsldm.5.14

DO - 10.2197/ipsjtsldm.5.14

M3 - Journal article

AN - SCOPUS:84864940152

SN - 1882-6687

VL - 5

SP - 14

EP - 22

JO - IPSJ Transactions on System LSI Design Methodology

JF - IPSJ Transactions on System LSI Design Methodology

ER -

Advances in PCB routing

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this