Differential Group Routing Merge Point Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In differential group pattern match routing for flip-chip designs, determining optimal merge points is challenging, especially for non-linearly arranged bump pins, leading to suboptimal routing results with increased routing distance variation and reduced length matching.
Innovation Solution
A method and apparatus for determining the optimal merge points by filtering out unroutable candidates, using a controllable cost function to evaluate routing quality, and identifying the best merge point through routability determination and cost calculation, with weighting factors prioritizing longer matching lengths and smaller diverged part lengths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If merge points are determined without considering routability constraints, then the number of candidate merge points increases, but the routing quality deteriorates due to increased routing distance variation
Solution Approach 1:
The patent performs preliminary routability determination to filter out invalid merge point candidates before performing the actual routing. This preliminary action identifies and removes merge points that would result in unroutable or suboptimal paths, thereby reducing routing distance variation while maintaining a sufficient set of valid candidates for optimization.
Solution Approach 2:
The patent introduces a controllable cost function with weighting factors that can be adjusted to balance different routing objectives. By changing these parameters (weighting factors), the system can optimize for different trade-offs between matching length and routing distance variation, allowing adaptation to different design requirements.
2Length of moving object
If merge points are selected to maximize signal matching length, then length matching improves, but routing distance variation increases due to suboptimal merge point locations
Solution Approach 1:
The patent uses a controllable cost function with adjustable weighting factors to balance the trade-off between matching length and routing distance. By modifying these parameters, the system can prioritize either length matching or routing optimization depending on the specific design requirements, resolving the contradiction between these two objectives.
Solution Approach 2:
The patent implements an iterative optimization process where the routing cost is calculated and fed back to adjust the merge point selection. This feedback mechanism allows the system to continuously improve the routing solution by evaluating the actual routing distance and matching length, then adjusting the cost function weights accordingly.
3Adaptability or versatility
If all possible merge points are considered, then routing options increase, but computational complexity increases due to extensive routing calculations
Solution Approach 1:
The patent performs preliminary routability determination to filter out invalid merge point candidates before performing the actual routing calculations. This preliminary action significantly reduces the number of candidates that require full routing evaluation, thereby reducing computational complexity while maintaining comprehensive routing options.
Solution Approach 2:
The patent extracts and removes obviously invalid or suboptimal merge point candidates from the consideration set based on simple geometric or topological criteria. This extraction process eliminates unnecessary computational effort while preserving the essential routing options that could lead to optimal solutions.
Data Source
AI summary
A method, apparatus and computer program products are provided for determining an entry finder from a plurality of merge points of a bounding box for an optimal performance of a differential group pattern match routing. One example method includes identifying each merge point candidate of a plurality of merge point candidates, performing a routability determination process, results of the routability determination process comprises a remaining subset of the plurality of merge point candidates, routing each remaining merge point from the remaining subset of the plurality of merge point candidates, calculating a routing cost for each remaining merge point from the remaining subset of the plurality of merge point candidates, and determining a merge point having a lowest calculated routing cost.


