On the escape routing of differential Pairs

Tan Yan, Pei Ci Wu, Qiang Ma, Martin D F Wong

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

Abstract

As an important step in PCB design, the escape routing problem has been extensively studied in literature. However, few studies have been done on the escape routing of differential pairs. In this paper, we study the differential pair escape routing problem and propose two algorithms. The first one computes the optimal routing for a single differential pair while the second one is able to simultaneously route multiple differential pairs considering both routability and wire length. We then propose a two-stage routing scheme based on the two algorithms. Experimental results show that our routing scheme efficiently and effectively solves the differential pair escape routing test cases we obtained from industry.

Original languageEnglish (US)
Title of host publication2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010
Pages614-620
Number of pages7
DOIs
StatePublished - Dec 1 2010
Event2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010 - San Jose, CA, United States
Duration: Nov 7 2010Nov 11 2010

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
ISSN (Print)1092-3152

Other

Other2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010
CountryUnited States
CitySan Jose, CA
Period11/7/1011/11/10

Fingerprint

Polychlorinated biphenyls
Wire
Industry

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Yan, T., Wu, P. C., Ma, Q., & Wong, M. D. F. (2010). On the escape routing of differential Pairs. In 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010 (pp. 614-620). [5654214] (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD). https://doi.org/10.1109/ICCAD.2010.5654214

On the escape routing of differential Pairs. / Yan, Tan; Wu, Pei Ci; Ma, Qiang; Wong, Martin D F.

2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010. 2010. p. 614-620 5654214 (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD).

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

Yan, T, Wu, PC, Ma, Q & Wong, MDF 2010, On the escape routing of differential Pairs. in 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010., 5654214, IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, pp. 614-620, 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010, San Jose, CA, United States, 11/7/10. https://doi.org/10.1109/ICCAD.2010.5654214
Yan T, Wu PC, Ma Q, Wong MDF. On the escape routing of differential Pairs. In 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010. 2010. p. 614-620. 5654214. (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD). https://doi.org/10.1109/ICCAD.2010.5654214
Yan, Tan ; Wu, Pei Ci ; Ma, Qiang ; Wong, Martin D F. / On the escape routing of differential Pairs. 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010. 2010. pp. 614-620 (IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD).
@inproceedings{60c22d0b9ab74f948140720d19c64428,
title = "On the escape routing of differential Pairs",
abstract = "As an important step in PCB design, the escape routing problem has been extensively studied in literature. However, few studies have been done on the escape routing of differential pairs. In this paper, we study the differential pair escape routing problem and propose two algorithms. The first one computes the optimal routing for a single differential pair while the second one is able to simultaneously route multiple differential pairs considering both routability and wire length. We then propose a two-stage routing scheme based on the two algorithms. Experimental results show that our routing scheme efficiently and effectively solves the differential pair escape routing test cases we obtained from industry.",
author = "Tan Yan and Wu, {Pei Ci} and Qiang Ma and Wong, {Martin D F}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/ICCAD.2010.5654214",
language = "English (US)",
isbn = "9781424481927",
series = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD",
pages = "614--620",
booktitle = "2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010",

}

TY - GEN

T1 - On the escape routing of differential Pairs

AU - Yan, Tan

AU - Wu, Pei Ci

AU - Ma, Qiang

AU - Wong, Martin D F

PY - 2010/12/1

Y1 - 2010/12/1

N2 - As an important step in PCB design, the escape routing problem has been extensively studied in literature. However, few studies have been done on the escape routing of differential pairs. In this paper, we study the differential pair escape routing problem and propose two algorithms. The first one computes the optimal routing for a single differential pair while the second one is able to simultaneously route multiple differential pairs considering both routability and wire length. We then propose a two-stage routing scheme based on the two algorithms. Experimental results show that our routing scheme efficiently and effectively solves the differential pair escape routing test cases we obtained from industry.

AB - As an important step in PCB design, the escape routing problem has been extensively studied in literature. However, few studies have been done on the escape routing of differential pairs. In this paper, we study the differential pair escape routing problem and propose two algorithms. The first one computes the optimal routing for a single differential pair while the second one is able to simultaneously route multiple differential pairs considering both routability and wire length. We then propose a two-stage routing scheme based on the two algorithms. Experimental results show that our routing scheme efficiently and effectively solves the differential pair escape routing test cases we obtained from industry.

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

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

U2 - 10.1109/ICCAD.2010.5654214

DO - 10.1109/ICCAD.2010.5654214

M3 - Conference contribution

AN - SCOPUS:78650876027

SN - 9781424481927

T3 - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

SP - 614

EP - 620

BT - 2010 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2010

ER -