Method and apparatus of an integrated circuit

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 a dummy micro bump from the dummy micro bumps, which is spaced from the signal bump by the Manhattan distance; and

generating a routing path between the at least one interconnecting candidate and the signal bump through a computer.

2. The computer-implemented method of claim 1 , further comprising a step of routing the 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.

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

4. 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.

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

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

7. 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.

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

9. 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.

10. 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.

11. 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.

12. 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.

13. 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.

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

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

16. 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.