Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of The 2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2007 |
Publisher | IEEE |
Pages | 396-400 |
Number of pages | 5 |
ISBN (Print) | 9781424413812 |
DOIs | |
Publication status | Published - 4 Nov 2007 |
Event | 2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2007 - DoubleTree Hotel, San Jose, United States Duration: 4 Nov 2007 → 8 Nov 2007 https://ieeexplore.ieee.org/xpl/conhome/4397222/proceeding (Conference proceedings) |
Publication series
Name | IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD |
---|---|
ISSN (Print) | 1092-3152 |
ISSN (Electronic) | 1558-2434 |
Conference
Conference | 2007 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2007 |
---|---|
Country/Territory | United States |
City | San Jose |
Period | 4/11/07 → 8/11/07 |
Internet address |
|
Scopus Subject Areas
- Software
- Computer Science Applications
- Computer Graphics and Computer-Aided Design