Routing (electronic design automation)

In <a href="/facts/Electronic_design/o4la3fmX">electronic design</a>, wire routing, commonly called simply routing, is a step in the design of <a href="/facts/Printed_circuit_board/muSR2p43">printed circuit boards</a> (PCBs) and <a href="/facts/Integrated_circuit/fjn6vg7C">integrated circuits</a> (ICs). It builds on a preceding step, called <a href="/facts/Placement_(electronic_design_automation)/lcheSkIL">placement</a>, which determines the location of each active element of an IC or component on a PCB. After placement, the routing step adds wires needed to properly connect the placed components while obeying all <a href="/facts/Design_rules/GW7N249M">design rules</a> for the IC. Together, the placement and routing steps of IC design are known as <a href="/facts/Place_and_route/UJgLLNdP">place and route</a>.
The task of all routers is the same. They are given some pre-existing polygons consisting of <a href="/facts/Pin_(electronics)/nW8ICkYs">pins</a> (also called terminals) on cells, and optionally some pre-existing wiring called preroutes. Each of these polygons are associated with a <a href="/facts/Net_(electronics)/Wwt4M3jo">net</a>, usually by name or number. The primary task of the router is to create geometries such that all terminals assigned to the same net are connected, no terminals assigned to different nets are connected, and all design rules are obeyed. A router can fail by not connecting terminals that should be connected (an open), by mistakenly connecting two terminals that should not be connected (a short), or by creating a design rule violation. In addition, to correctly connect the nets, routers may also be expected to make sure the design meets timing, has no <a href="/facts/Crosstalk/IT2LIwth">crosstalk</a> problems, meets any metal density requirements, does not suffer from <a href="/facts/Antenna_effect/o8nhIJxJ">antenna effects</a>, and so on. This long list of often conflicting objectives is what makes routing extremely difficult.
Almost every problem associated with routing is known to be <a href="/facts/Computational_complexity_theory/etHuVF3U">intractable</a>. The simplest routing problem, called the <a href="/facts/Steiner_tree/5mhCq8cN">Steiner tree</a> problem, of finding the shortest route for one net in one layer with no obstacles and no design rules is known to be <a href="/facts/NP-complete/NFPv56DU">NP-complete</a>, both in the case where all angles are allowed or if routing is restricted to only horizontal and vertical wires. Variants of <a href="/facts/Channel_router/uyKWjlEY">channel routing</a> have also been shown to be NP-complete, as well as routing which reduces <a href="/facts/Crosstalk/IT2LIwth">crosstalk</a>, number of <a href="/facts/Via_(electronics)/WzYthtKS">vias</a>, and so on.
Routers therefore seldom attempt to find an optimum result. Instead, almost all routing is based on <a href="/facts/Heuristic_(computer_science)/PM2qkoa2">heuristics</a> which try to find a solution that is good enough.
Design rules sometimes vary considerably from layer to layer. For example, the allowed width and spacing on the lower layers may be four or more times smaller than the allowed widths and spacings on the upper layers. This introduces many additional complications not faced by routers for other applications such as <a href="/facts/Printed_circuit_board/muSR2p43">printed circuit board</a> or <a href="/facts/Multi-chip_module/AzyVaNNp">multi-chip module</a> design. Particular difficulties ensue if the rules are not simple multiples of each other, and when vias must traverse between layers with different rules.

Routing (electronic design automation) open-in-new

Routing (electronic design automation)