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

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

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 (US)
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
State	Published - 2012

Keywords

Escape routing
Length-matching routing
Network-flow
PCB routing

ASJC Scopus subject areas

Computer Science Applications
Electrical and Electronic Engineering

Online availability

10.2197/ipsjtsldm.5.14

Library availability

Discover UIUC Full Text

Cite this

@article{7e1a7b80abfe418190061950bac72127,

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.}",

year = "2012",

doi = "10.2197/ipsjtsldm.5.14",

language = "English (US)",

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

Y1 - 2012

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

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

U2 - 10.2197/ipsjtsldm.5.14

DO - 10.2197/ipsjtsldm.5.14

M3 - 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

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this