Topology-Driven Line Probing for IC Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current IC design tools face challenges in efficiently routing complex circuits due to high complexity and integration densities, leading to sub-optimal routes and increased time-to-market, with existing shape-based approaches not guaranteeing optimal paths and graph-based methods being inefficient for large designs.
Innovation Solution
The implementation of topology-driven line probing techniques that use a priority queue to find a minimal-cost path between source and target points, allowing for real-time interactive routing with flexible topology guides and precise control over routing layers, ensuring design rule compliance and optimal path guarantees.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If shape-based routing approaches are used, then routing flexibility is improved, but optimal path guarantee is lost
Solution Approach 1:
The routing problem is segmented into multiple layers with different routing costs, allowing the algorithm to explore different paths systematically while maintaining flexibility. Each layer can be routed independently with its own cost parameters, enabling both flexibility and optimality.
Solution Approach 2:
The patent introduces variable routing costs for different layers and uses a priority queue to dynamically select the lowest cost path at each step. This parameter-based approach allows the system to adapt to different routing scenarios while guaranteeing optimality through systematic exploration.
2Reliability
If graph-based routing methods are used, then optimal path is guaranteed, but efficiency for large designs deteriorates
Solution Approach 1:
The patent transitions from traditional 2D planar routing to a multi-layer 3D routing approach. By adding the layer dimension with different routing costs, the algorithm can find optimal paths more efficiently without having to explore all possible paths in a single plane, thus improving efficiency while maintaining optimality.
Solution Approach 2:
The patent pre-establishes multiple routing layers with different costs before the actual routing process. This preliminary structure allows the priority queue algorithm to quickly select optimal paths without performing exhaustive searches during routing, significantly improving efficiency for large designs.
3Reliability
If complex routing algorithms are used, then routing optimality is improved, but startup time increases
Solution Approach 1:
The routing layers and their associated costs are pre-configured before the routing process begins. This preliminary setup allows the algorithm to start execution immediately without performing time-consuming initial computations, reducing startup time while maintaining optimality through the pre-established multi-layer structure.
Data Source
AI summary
Techniques and systems for determining a route from a start point to a target point in an integrated circuit (IC) design using topology-driven line probing are described. Some embodiments can create a data structure to store a set of nodes, wherein each node is located on a horizontal probe or a vertical probe, and wherein each node has a cost. The embodiments can then perform a set of operations in an iterative loop, the set of operations comprising: selecting a lowest cost node from the set of nodes; terminating the iterative loop if the lowest cost node is located at the target point; extending a probe from the lowest cost node if the lowest cost node is not located at the target point; creating at least one new node on the probe or on an ancestor of the probe; and adding the new node to the set of nodes.