Automated Rip-Up and Reroute Techniques

The ultimate goal of all automated routing systems is to interconnect 100% of the necessary point-to-point electrical connections. However, most automated routing systems fail to find acceptable paths for all required connections because of limited routing resources or problem complexity. Therefore, a cleanup phase is often necessary. During this cleanup phase, connectivity can be improved through a variety of manual and automated techniques. This paper concentrates on one automated technique, rip-up and reroute. Various rip-up and reroute strategies are discussed and evaluated, and experimental results are provided.

[1]  Robert J. Smith,et al.  A High-Density Multilayer PCB Router Based on Necessary and Sufficient Conditions for Single Row Routing , 1981, 18th Design Automation Conference.

[2]  Dave Hightower,et al.  A Generalized Channel Router , 1980, 17th Design Automation Conference.

[3]  Jiri Soukup,et al.  Fast Maze Router , 1978, 15th Design Automation Conference.

[4]  Ola A. Marvik.  An Interactive Routing Program with On-Line Clean-Up of Sketched Routes , 1979, 16th Design Automation Conference.

[5]  Robert J. Smith,et al.  Performance of Interconnection Rip-Up and Reroute Strategies , 1981, 18th Design Automation Conference.

[6]  Jiri Soukup.  Global Router , 1979, 16th Design Automation Conference.

[7]  Tokinori Kozawa,et al.  An Algorithm for Searching Shortest Path by Propagating Wave Fronts in Four Quadrants , 1981, 18th Design Automation Conference.

[8]  Frank Rubin.  An iterative technique for printed wire routing , 1974, DAC '74.

[9]  Michel T. Doreau,et al.  TWIGY A Topological Algorithm Based Routing System , 1981, 18th Design Automation Conference.

[10]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[11]  Melvin A. Breuer,et al.  Some theoretical aspects of algorithmic routing , 1977, DAC '77.