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

Tao Lin, Sheqin Dong, Song Chen, Satoshi Goto

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

1 Citation (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 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.

Original languageEnglish
Title of host publicationProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Pages151-156
Number of pages6
DOIs
Publication statusPublished - 2012
Event17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012 - Sydney, NSW
Duration: 2012 Jan 302012 Feb 2

Other

Other17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012
CitySydney, NSW
Period12/1/3012/2/2

Fingerprint

Dynamic programming
Printed circuit boards

ASJC Scopus subject areas

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

Cite this

Lin, T., Dong, S., Chen, S., & Goto, S. (2012). Linear optimal one-sided single-detour algorithm for untangling twisted bus. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 151-156). [6164936] https://doi.org/10.1109/ASPDAC.2012.6164936

Linear optimal one-sided single-detour algorithm for untangling twisted bus. / Lin, Tao; Dong, Sheqin; Chen, Song; Goto, Satoshi.

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2012. p. 151-156 6164936.

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

Lin, T, Dong, S, Chen, S & Goto, S 2012, Linear optimal one-sided single-detour algorithm for untangling twisted bus. in Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC., 6164936, pp. 151-156, 17th Asia and South Pacific Design Automation Conference, ASP-DAC 2012, Sydney, NSW, 12/1/30. https://doi.org/10.1109/ASPDAC.2012.6164936
Lin T, Dong S, Chen S, Goto S. Linear optimal one-sided single-detour algorithm for untangling twisted bus. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2012. p. 151-156. 6164936 https://doi.org/10.1109/ASPDAC.2012.6164936
Lin, Tao ; Dong, Sheqin ; Chen, Song ; Goto, Satoshi. / Linear optimal one-sided single-detour algorithm for untangling twisted bus. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2012. pp. 151-156
@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",

}

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

SN - 9781467307727

SP - 151

EP - 156

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

ER -