New strategies for PCB routing

As IC technology advances rapidly, the dimensions of packages and PCBs are decreasing while the pin counts and routing layers keep increasing. Today, a high-performance PCB usually contains thousands of pins and more than ten signal layers. Moreover, the manufacturing constraints require all nets to be routed in the planar fashion and the designer requires nets in the same bus to be routed together without any other net. All these factors pose new challenges for the PCB routing problem, making the PCB routing so difficult that no commercial CAD software can provide an automatic solution. Today, all high-end circuit boards are routed manually, in a time-consuming manner. In this dissertation, we present new strategies for automatic PCB routing. In particular, we present novel algorithms for bus sequencing, pin assignment, bus planning, bus escape, and escape routing.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical & Computer Engr

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Kong, Hui

Contributors dc:contributor

• Wong, Martin D.F.
• Patel, Sanjay J.
• Chen, Deming
• Ozdal, Muhammet Mustafa

• Algorithms
• Circuits
• Printed Circuit Board (PCB) Routing

Statement dc:rights

• Copyright 2010 Hui Kong

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/18462

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/18462