# US 2008/0301618 A1 · Method and System for Routing of Integrated Circuit Design

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0301618 A1
- Document ID: US20080301618A1
- Status: Published application
- Kind: A1
- Application number: 12/122,259
- Filed: 2008-05-16
- Published: 2008-12-04
- Earliest claimed: 2007-06-01
- Assignees: International Business Machines Corporation
- Inventors: Lukas Daellenbach
- Web page: https://patentgrep.com/patent/US20080301618A1

## CPC

- G06F 30/394: Routing (G06F30/396 takes precedence)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The invention relates to a method and a system for routing electric circuits in integrated circuit chip design. Specifically, the invention encompasses the steps of performing a congestion analysis (208) for a given routed placement of cells (11) containing said electric circuits on chip (10); defining (210) a critical area (14) on said chip (10) based on congestion information (208); analyzing (212) actual wiring quality within said critical area (14); comparing (214, 216) actual wiring quality of said critical area (14) with a reference wiring quality of said critical area (14); and rerouting (218) said critical area (14) based on a comparison (216) between actual wiring quality and reference wiring quality.

## Claims

### Claim 1

A method for routing electric circuits in integrated circuit chip design, comprising the steps of:
performing a congestion analysis (208) for a given routed placement of cells (11) containing said electric circuits on chip (10);
defining (210) a critical area (14) on said chip (10) based on congestion information (208);
analyzing (212) actual wiring quality within said critical area (14);
comparing (214, 216) actual wiring quality of said critical area (14) with a reference wiring quality of said critical area (14);
rerouting (218) said critical area (14) based on a comparison (216) between actual wiring quality and reference wiring quality.

### Claim 2 (depends on 1)

The method of claim 1, characterized in that the step of defining (210) a critical area (14) comprises
selecting a region (12) of wiring congestion based on said congestion analysis;
comparing the size of said region (12) to a reference size;
if the size of said region (12) is less than or equal to the reference size, take said region (12) as critical area (14);
if the size of said region (12) exceeds the reference size, partitioning said region (12) into several critical areas (14) of size smaller than said reference size.

### Claim 3 (depends on 1)

The method of claim 1, characterized in that the step of analyzing (212) actual wiring quality within critical area (14) comprises a via (120) count in said critical area (14).

### Claim 4 (depends on 1)

The method of claim 1, characterized in that the step of analyzing (212) actual wiring quality within critical area (14) comprises counting the number of wiring segments in said critical area (14).

### Claim 5 (depends on 1)

The method of claim 1, characterized in that the step of analyzing (212) actual wiring quality within critical area (14) comprises calculating the lengths of actual wiring (141, 144) in complete and partial nets (131, 134) within said critical area (14).

### Claim 6 (depends on 1)

The method of claim 1, characterized in that the step of comparing (214, 216) actual wiring quality of said critical area (14) with reference wiring quality of said critical area (14) comprises
calculating the manhattan distance (151, 154) of nets (131, 134) within said critical area (14);
comparing said manhattan distance (151, 154) to actual wiring (141, 144) of nets (131, 134) within said critical area (14);
selecting nets (131) for rerouting based on this comparison.

### Claim 7 (depends on 1)

The method of claim 1, characterized in that the step of rerouting (218) said critical area (14) comprises
selecting nets (131) within said critical area (14) for replacement based on said comparison between actual wiring quality and reference wiring quality;
replacing actual wiring (141) in said selected nets (131) by reference wiring (151).

### Claim 8 (depends on 7)

The method of claim 7, characterized in that said nets (131, 134) within said critical area (14) comprise complete (131) and partial (134) nets.

### Claim 9

A method for routing electric circuits in integrated circuit chip design, comprising the steps of
performing a placement process of cells (11) containing said electric circuits on chip (10);
performing a routing process;
performing a congestion analysis (208) routed electric circuits on chip (10);
defining (210) a critical area (14) based on congestion analysis (208);
comparing (212, 214, 216) wiring quality in said critical area (14) to reference;
rerouting (218) said critical area (14).

### Claim 10 (depends on 1)

A system for placing and routing electric circuits in integrated circuit chip design, comprising
a placement system (311) for placing cells (11) containing said electric circuits on a chip (10);
a routing system (312) for global routing of said cells (11) placed on said chip (10) and for detailed routing of said electric circuits;
a rerouting system (313) for rerouting a critical area (14) on chip (10) according to a method of claim 1.

### Claim 11 (depends on 10)

The system of claim 10, wherein the rerouting system (313) comprises
a congestion analysis system (314) for defining a critical area (14) on chip (10) based on congestion information;
a wiring analysis system (315) for analyzing wiring quality within critical area (14) with respect to reference wiring quality;
a route replacement system (316) for rerouting critical area (14).

### Claim 12 (depends on 1)

A data processing program for execution in a data processing system comprising software code portions for performing a method according to claim 1 when said program is run on said computer.

### Claim 13 (depends on 1)

A program product stored on a computer usable medium comprising computer readable program means for causing a computer to perform a method according to claim 1 when said program is run on said computer.

### Claim 14

A program product stored on a computer usable medium comprising computer readable program means for routing electric circuits placed on a chip (10), wherein the computer readable program when executed on a computer causes the computer to
perform a congestion analysis of routed electric circuits on chip (10);
define a critical area (14) on chip (10) based on congestion information;
analyze wiring quality within critical area (14) with respect to reference wiring quality;
reroute critical area (14).
