Graph-Based IC Routing for Precise Feedthrough Placement

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing integrated circuit routing methods, particularly those using global routing or designer pre-inserted feedthroughs, result in increased detours and limited controllability due to imprecise placement, which does not align with the final layout requirements.

Innovation Solution

A graph-based method is employed to generate routing data by creating a configuration file from partition information and using algorithms like Bellman Ford, BFS, DFS, Floyd Warshall, or Dijkstra's to find a minimum cost path between partitions, ensuring precise feedthrough placement.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Extent of automation

If global routing is used to place feedthroughs, then routing automation is improved, but routing precision and controllability deteriorate

Engineering Contradiction:

Improverouting automationVSAvoidfeedthrough placement precision

Core Design Contradiction:

Extent of automationVSManufacturing precision

Solution Approach 1:

The patent applies preliminary action by pre-calculating and pre-placing feedthroughs in the graph-based routing model before final layout completion. The system establishes feedthrough paths in advance based on partition information and adjacency graphs, allowing precise control over feedthrough placement while maintaining automation through algorithmic generation of routing data.

Inventive Principle:

Principle #10Preliminary action

2Manufacturing precision

If designer pre-inserted feedthroughs are used, then routing controllability is improved, but routing accuracy deteriorates

Engineering Contradiction:

Improvefeedthrough placement precisionVSAvoidrouting efficiency

Core Design Contradiction:

Manufacturing precisionVSProductivity

Solution Approach 1:

The patent implements self-service by enabling the routing system to automatically generate and optimize feedthrough paths based on partition information without requiring manual designer intervention. The graph-based algorithm autonomously determines optimal routes, calculates minimum cost paths, and generates routing data, thereby maintaining high accuracy while significantly improving routing efficiency and productivity.

Inventive Principle:

Principle #25Self-service

3Device complexity

If feedthroughs are placed without graph-based optimization, then routing simplicity is improved, but routing cost increases

Engineering Contradiction:

Improverouting process complexityVSAvoidrouting detour cost

Core Design Contradiction:

Device complexityVSLoss of energy

Solution Approach 1:

The patent applies parameter changes by transforming the routing problem into a graph theory optimization problem. The system represents partitions as nodes and possible connections as edges with weights representing routing costs, then uses algorithms to calculate minimum cost paths. This mathematical transformation enables efficient optimization of routing parameters to minimize detours and routing costs while maintaining manageable process complexity.

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS20250322138A1Graph-based method of generating routing data for integrated circuit

Publication Date: 2025.10.16 MEDIATEK INC

AI summary

A graph-based method comprises generating a configuration file according to partition information, and performing a graph-based algorithm according to the configuration file to find a minimum cost path starting from a starting node, passing an intermediate node and terminating at an ending node. The configuration file comprises vertexes and adjacency information.