Presentation
Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints
SessionRoute Me if You Can!
DescriptionWe propose a golden-pin-based algorithm to handle an irregular PCB routing problem with angle and topology constraints. Unlike traditional schemes that treat escape and bus routing separately, we consider their continuity and find the desired solution to the joint routing. Minimum weight vertex covering and self-adaptable ordering methods are presented to guarantee successful bus routing. In addition, we present a golden-pin-based scheme to improve routing results and apply the disjoint paths model to eliminate congestion. Experimental results show that our algorithm achieves 90% runtime reduction with similar routability to the Allegro PCB Router.
Event Type
Research Manuscript
TimeTuesday, July 11th3:55pm - 4:10pm PDT
Location3008, 3rd Floor
EDA
Physical Design and Verification