TY - GEN
T1 - Untangling twisted nets for bus routing
AU - Yan, Tan
AU - Wong, Martin D.F.
PY - 2007
Y1 - 2007
N2 - Previous works [1], [2] on PCB bus routing assume matched pin ordering for both sides. But in practice, the pin ordering might be mismatched and the nets become twisted. In this paper, we propose a preprocessing step to untangle such twisted nets. We also present an algorithm to solve this untangling problem. Our algorithm produces an optimal singledetour routing scheme that rematches the pin ordering. By integrating our preprocessing step into the bus router in [2], we show that many routing problems that cannot be solved previously can now be solved with insignificant increase in runtime.
AB - Previous works [1], [2] on PCB bus routing assume matched pin ordering for both sides. But in practice, the pin ordering might be mismatched and the nets become twisted. In this paper, we propose a preprocessing step to untangle such twisted nets. We also present an algorithm to solve this untangling problem. Our algorithm produces an optimal singledetour routing scheme that rematches the pin ordering. By integrating our preprocessing step into the bus router in [2], we show that many routing problems that cannot be solved previously can now be solved with insignificant increase in runtime.
UR - http://www.scopus.com/inward/record.url?scp=50249139142&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50249139142&partnerID=8YFLogxK
U2 - 10.1109/ICCAD.2007.4397297
DO - 10.1109/ICCAD.2007.4397297
M3 - Conference contribution
AN - SCOPUS:50249139142
SN - 1424413826
SN - 9781424413829
T3 - IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
SP - 396
EP - 400
BT - 2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD
T2 - 2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD
Y2 - 4 November 2007 through 8 November 2007
ER -