Weighted and Iterative Multi-wire Routing
Original Publication Date: 1982-Dec-01
Included in the Prior Art Database: 2005-Feb-10
The efficient iterative capabilities of electronic data processing are employed for the design of wire routes on printed circuit cards. The individual wire paths are routed using an algorithm in which all surrounding points at each point as the path is defined are assigned cumulative penalty weights. Alternative paths for individual wires are examined until each path is eliminated by defined barriers. A path of minimum penalty weight is sought. Paths for multiple wires are first plotted by assigning a low penalty weight to crossovers of the wires. The wires are replotted iteratively, with progressively higher penalty weights assigned to crossovers, vias, and other factors.