A correct network flow model for escape routing

Escape routing for packages and PCBs has been studied extensively in the past. Network flow is pervasively used to model this problem. However, none of the previous works correctly models the diagonal capacity, which is essential for 45° routing in most packages and PCBs. As a result, existing algor...

Full description

Saved in:
Bibliographic Details
Published in2009 46th ACM/IEEE Design Automation Conference pp. 332 - 335
Main Authors Yan, Tan, Wong, Martin D. F.
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 26.07.2009
IEEE
SeriesACM Conferences
Subjects
diagonal capacity
Escape routing
Hardware > Electronic design automation > Physical design (EDA) > Placement
Hardware > Electronic design automation > Physical design (EDA) > Wire routing
missing pin
network flow
package routing
PCB routing
Routing
missing pin
network flow
package routing
escape routing
diagonal capacity
PCB routing
Online AccessGet full text
ISBN9781605584973
1605584975
ISSN0738-100X
DOI10.1145/1629911.1630001

Cover

More Information
Summary:Escape routing for packages and PCBs has been studied extensively in the past. Network flow is pervasively used to model this problem. However, none of the previous works correctly models the diagonal capacity, which is essential for 45° routing in most packages and PCBs. As a result, existing algorithms may either produce routing solutions that violate the diagonal capacity or fail to output a legal routing even though there exists one. In this paper, we propose a new network flow model that guarantees the correctness when diagonal capacity is taken into consideration. This model leads to the first optimal algorithm for escape routing. We also extend our model to handle missing pins.
ISBN:9781605584973
1605584975
ISSN:0738-100X
DOI:10.1145/1629911.1630001