# US 2013/0159950 A1 · Method and apparatus of an integrated circuit

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

- Number: US 2013/0159950 A1
- Document ID: US20130159950A1
- Status: Published application
- Kind: A1
- Application number: 13/328,403
- Filed: 2011-12-16
- Published: 2013-06-20
- Earliest claimed: 2011-12-16
- Assignees: Industrial Technology Research Institute
- Inventors: CHANG TZU LIN; DING MING KWAI
- Web page: https://patentgrep.com/patent/US20130159950A1

## CPC

- G06F 30/398: Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM] (optical proximity correction [OPC] design processes G03F1/36)
- G06F 30/392: Floor-planning or layout, e.g. partitioning or placement
- G06F 30/394: Routing (G06F30/396 takes precedence)
- G06F 2119/12: Timing analysis or timing optimisation
- G06F 2119/18: Manufacturability analysis or optimisation for manufacturability
- Y02P 90/02: Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02P: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS

## Abstract

A computer-implemented method for interconnect redundancy of a circuit design comprises the steps of setting Manhattan distance being less than or equal to three pitches; placing a plurality of dummy micro bumps on at least one side of a die including a signal bump formed on the at least one side; determining an interconnecting candidate by selecting from the dummy micro bumps, which is distant from the signal bump by the Manhattan distance; and providing a routing path between the at least one interconnecting candidate and the signal bump

## Claims

### Claim 1

A computer-implemented method for interconnect redundancy of a circuit design, comprising the steps of:
setting Manhattan distance less than or equal to a predetermined value;
placing a plurality of dummy micro bumps on at least one side of a die including a signal bump formed on the at least one side;
determining an interconnecting candidate by selecting from the dummy micro bumps, which is distant from the signal bump by the Manhattan distance; and
providing a routing path between the at least one interconnecting candidate and the signal bump.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising a step of routing rest of the dummy micro bumps to form at least one micro bump set, and each micro bump set has at least two dummy micro bumps

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the predetermined value is less than or equal to three pitches.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein a pitch is sum of a distance between two bumps' edge and a diameter of a bump.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the signal bump comprises a via.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein the via comprises a Through Silicon Via (TSV).

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the step of placing a plurality of dummy micro bumps on at least one side of a die comprises a step of forming a micro bump matrix.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the routing path between interconnecting candidate and the signal bump further comprises a routing path goes directly from the signal bump to the interconnecting candidate that is a pitch away from the signal bump.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the routing path between interconnecting candidate and the signal bump further comprises a routing path having no bend, wherein the interconnection candidate is two pitches away from the signal bump or three pitches away from the signal bump.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the routing path between interconnecting candidate and the signal bump further comprises a single bend, wherein the interconnecting candidate is two pitches away from the signal bump.

### Claim 11 (depends on 1)

The computer-implemented method of claim 1, wherein the routing path between interconnecting candidate and the signal bump further comprises a first bending portion, a horizontal portion and a second bending portion.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein the first bending portion couples to the signal bump, the horizontal portion couples to the first bending portion and the second bending portion, and the second bending portion couples to the interconnection candidate.

### Claim 13 (depends on 12)

The computer-implemented method of claim 12, wherein the first bending portion is disposed alone a first diagonal line having a first angle with a horizontal line and the second bending portion is disposed alone a second diagonal line having a second angle with a horizontal line, or the first bending portion is disposed alone a first vertical line and the second bending portion is disposed alone a second vertical line.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13, wherein the first angle and the second angle are 45 degrees.

### Claim 15 (depends on 1)

The computer-implemented method of claim 1, wherein the routing path between interconnecting candidate and the signal bump further comprises a detour.

### Claim 16 (depends on 1)

The computer-implemented method of claim 1, wherein the routing path between the interconnecting candidate and the signal bump comprises no bend and passes through a TSV, wherein the interconnection candidate is three pitches away from the signal bump.

### Claim 17

A computer-implemented method for timing analysis of integrated circuit design, comprising the steps of:
generating a physical layout of an integrated circuit;
performing interconnect redundancy on the physical layout of the integrated circuit to create a plurality of redundant interconnections, wherein the interconnect redundancy is based on a physical layout of an integrated circuit to be bonded;
performing a first static timing analysis to compute an first expected timing of the integrated circuit;
performing a first redundant interconnections removing to remove the redundant interconnections which have timing violations according to the first expected timing; and
outputting a chip layout.

### Claim 18 (depends on 17)

The computer-implemented method of claim 17 further comprises stacking a plurality of chips.

### Claim 19 (depends on 18)

The computer-implemented method of claim 18, wherein the plurality of chips layout includes a first chip layout having redundant interconnection on an lower side, a plurality of second chip layouts having redundant interconnections on an upper side and a lower side, and a third chip having redundant interconnections on an upper side.

### Claim 20 (depends on 19)

The computer-implemented method of claim 19, wherein the plurality of second chip layouts are sandwiched between the first chip layout and the third chip layout.

### Claim 21 (depends on 18)

The computer-implemented method of claim 18 further comprises performing a second static timing analysis to computing a second expected timing of the integrated circuit.

### Claim 22 (depends on 21)

The computer-implemented method of claim 21 further comprises performing a second removing redundant interconnection to remove the redundant interconnections which have timing violation according to the second expected timing.

### Claim 23 (depends on 18)

The computer-implemented method of claim 18 further comprises outputting a three dimension chip layout.

### Claim 24

An apparatus for timing analysis of integrated circuit design, comprising:
a redundant interconnection device configured to provide a plurality of routing paths, each routing path connecting a signal bump on a semiconductor device to one of a plurality of dummy micro bumps on the semiconductor device, and the one of the plurality of dummy micro bumps being distant from the signal bump within a predetermined Manhattan distance;
a static timing analyzer configured to provide timing information on a circuit on the semiconductor device; and
a redundant interconnection removing device configured to remove a routing path that violates the timing information.

### Claim 25 (depends on 24)

The apparatus of claim 24, wherein the redundant interconnection device is further configured to form routing paths for dummy micro bumps that do not connect to the signal bump.

### Claim 26 (depends on 24)

The apparatus of claim 24, wherein the predetermined Manhattan distance less than or equal to three pitches.

### Claim 27 (depends on 24)

The apparatus of claim 24, wherein the semiconductor device comprises a plurality of dies stacked on each other.
