英文摘要 |
"We proposed previously a fast single-layer two-terminal nets routing algorithm with time complexity of O(pN) and space complexity of O(N), where p is the number of two-terminal nets and N is the number of free nodes in the raster. The algorithm, a heuristic solution which performs reasonably well in the aspect of wire length, is based on prioritizing and reordering of the nets to be routed considering the number of intersections each net encounters and the total wire length. This article extends the above-mentioned algorithm to obtain two new algorithms: one is a sophisticated multi-layer two-terminal nets routing algorithm with the capability to optimize the number of layers and total wire length, and the other has the capacity to deal with physical constrains in PCB routing by creating weighted regions along the routing paths and priority modification. Both algorithms have the time complexity of O(p2N) and space complexity of O(N), where p is the number of two-terminal nets and N is the number of raster cells. The foundational multi-layer two-terminal nets routing algorithm first utilizes the Higher Geometry Maze Router algorithm to connect all nets, and then performs prioritized reordering of the nets before applying the concept of Clique Cover for initial layering. Finally, the number of layers is reduced and the total wire length is optimized. The algorithm with weighted region has great potential to cope with physical design problems commonly faced by PCB routing tools, such as shielding the paths of sensitive signals or dealing with keep out zones." |