Linear optimal one-sided single-detour algorithm for untangling twisted bus

Tao Lin; Sheqin Dong; Song Chen; Satoshi Goto

doi:10.1109/ASPDAC.2012.6164936

Linear optimal one-sided single-detour algorithm for untangling twisted bus

Tao Lin^*, Sheqin Dong, Song Chen, Satoshi Goto

^*Corresponding author for this work

Waseda University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n ³) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental results show that our algorithms runs much faster than the previous work due to its low time complexity.

Original language	English
Title of host publication	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Pages	151-156
Number of pages	6
DOIs	https://doi.org/10.1109/ASPDAC.2012.6164936
Publication status	Published - 2012
Event	17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012 - Sydney, NSW Duration: 2012 Jan 30 → 2012 Feb 2

Other

Other	17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012
City	Sydney, NSW
Period	12/1/30 → 12/2/2

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Science Applications
Computer Graphics and Computer-Aided Design

Access to Document

10.1109/ASPDAC.2012.6164936

Cite this

@inproceedings{01bc30b7e08a496a8946c9c24ca5d9a4,

title = "Linear optimal one-sided single-detour algorithm for untangling twisted bus",

abstract = "We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n 3) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental results show that our algorithms runs much faster than the previous work due to its low time complexity.",

author = "Tao Lin and Sheqin Dong and Song Chen and Satoshi Goto",

year = "2012",

doi = "10.1109/ASPDAC.2012.6164936",

language = "English",

isbn = "9781467307727",

pages = "151--156",

booktitle = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

note = "17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012 ; Conference date: 30-01-2012 Through 02-02-2012",

}

TY - GEN

T1 - Linear optimal one-sided single-detour algorithm for untangling twisted bus

AU - Lin, Tao

AU - Dong, Sheqin

AU - Chen, Song

AU - Goto, Satoshi

PY - 2012

Y1 - 2012

N2 - We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n 3) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental results show that our algorithms runs much faster than the previous work due to its low time complexity.

AB - We considered the one-sided single-detour untangling twisted nets problem for printed circuit board bus routing. A previous optimal dynamic programming based O(n 3) algorithm was proposed in a previous work, where n is the number of nets. In this paper, we propose an optimal O(n) untangling algorithm without considering capacity, and this algorithm is further modified to consider capacity. Experimental results show that our algorithms runs much faster than the previous work due to its low time complexity.

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

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

U2 - 10.1109/ASPDAC.2012.6164936

DO - 10.1109/ASPDAC.2012.6164936

M3 - Conference contribution

AN - SCOPUS:84860001534

SN - 9781467307727

SP - 151

EP - 156

BT - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

T2 - 17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012

Y2 - 30 January 2012 through 2 February 2012

ER -

Linear optimal one-sided single-detour algorithm for untangling twisted bus

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this