US PATENT SUBCLASS 395 / 500.14
.~.~ Global routing (e.g., shortest path, dead space, or duplicate trace elimination)

Current as of: June, 1999
Click HD for Main Headings
Click for All Classes

Internet Version by PATENTEC © 1999      Terms of Use


395 /   HD   INFORMATION PROCESSING SYSTEM ORGANIZATION

500.02  DF  CIRCUIT DESIGN {8}
500.13  DF  .~ Routing (e.g., routing map, netlisting) {4}
500.14.~.~ Global routing (e.g., shortest path, dead space, or duplicate trace elimination)

DEFINITION

Classification: 395/500.14

Global routing (e.g., shortest path, dead space, or duplicate trace elimination):

(under subclass 500.13) Subject matter comprising means or steps for evaluating or determining the shortest interconnection paths or minimizing the number of channels required for placing the conductor paths between nets.

(1) Note. In global routing, the wiring path capacities in a path net or between plural path routing regions and their relationships are usually modeled as graph or trees.

(2) Note. Procedures for determining the shortest paths may include, for example, Maze routing algorithm, Lee /'3ds algorithm, Soukup /'3ds algorithm, Hadlock /'3ds algorithm, or Steiner tree-based algorithm.