# US 2011/0035717 A1 · Design Optimization for Circuit Migration

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

- Number: US 2011/0035717 A1
- Document ID: US20110035717A1
- Status: Published application
- Kind: A1
- Application number: 12/846,594
- Filed: 2010-07-29
- Published: 2011-02-10
- Earliest claimed: 2009-08-05
- Assignees: Taiwan Semiconductor Manufacturing Company, Ltd.
- Inventors: Lee-Chung Lu; Yi-Kan Cheng; Chung-Hsing Wang; Chen-Fu Alex Huang; Hsiao-Shu Chao; Chin-Yu Chiang; Ho Che Yu; Chih Sheng Tsai; Shu Yi Ying
- Web page: https://patentgrep.com/patent/US20110035717A1

## 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/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 30/39: Circuit design at the physical level (physical level design for reconfigurable circuits G06F30/347)
- G06F 30/396: Clock trees
- G06F 30/392: Floor-planning or layout, e.g. partitioning or placement
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An embodiment of the present invention is a computer program product for providing an adjusted electronic representation of an integrated circuit layout. The computer program product has a medium with a computer program embodied thereon. Further, the computer program comprises computer program code for providing full node cells from a full node netlist, computer program code for scaling the full node cells to provide shrink node cells, computer program code for providing a timing performance of the full node cells and the shrink node cells, computer program code for comparing the timing performance of the full node cells to the timing performance of the shrink node cells, and computer program code for providing a first netlist.

## Claims

### Claim 1

A computer program product for providing an adjusted electronic representation of an integrated circuit layout, the computer program product having a medium with a computer program embodied thereon, the computer program comprising:
computer program code for providing full node cells from a full node netlist;
computer program code for scaling the full node cells to provide shrink node cells;
computer program code for providing a timing performance of the full node cells and the shrink node cells;
computer program code for comparing the timing performance of the full node cells to the timing performance of the shrink node cells; and
computer program code for providing a first netlist.

### Claim 2 (depends on 1)

The computer program product of claim 1, wherein the computer program further comprises:
computer program code for providing derivative cells of at least one shrink node cell, wherein each derivative cell comprises a variation of the at least one shrink node cell;
computer program code for providing a timing performance of the derivative cells;
computer program code for comparing the timing performance of the derivative cells to the timing performance of the full node cells; and
wherein the first netlist comprises at least one derivative cell that minimizes a difference between the timing performance of the at least one shrink node cell and a corresponding full node cell.

### Claim 3 (depends on 2)

The computer program product of claim 2, wherein the computer program code for providing a timing performance of the full node cells and the shrink node cells and the computer program code for providing a timing performance of the derivative cells each comprise providing a delay file comprising a timing performance of the full node cells, the shrink node cells, or the derivative cells.

### Claim 4 (depends on 1)

The computer program product of claim 1, wherein the computer program further comprises:
computer program code for analyzing a timing performance of the first netlist; and
computer program code for providing modified netlist comprising a modification of the first netlist.

### Claim 5 (depends on 1)

The computer program product of claim 1, wherein the first netlist comprises at least one shrink node cell.

### Claim 6 (depends on 1)

The computer program product of claim 1, wherein the computer program further comprises computer program code for providing a delay file of the first netlist.

### Claim 7

A computer program product for providing an adjusted electronic representation of an integrated circuit layout, the computer program product having a medium with a computer program embodied thereon, the computer program comprising:
computer program code for providing a timing performance of a path in a first netlist;
computer program code for identifying a first cell in the path that violates a timing performance parameter;
computer program code for providing a first modified netlist comprising a variation of the first netlist to compensate for the first cell in the path that violates the timing performance parameter; and
computer program code for providing a final netlist.

### Claim 8 (depends on 7)

The computer program product of claim 7, wherein the variation of the first netlist includes a derivative cell of the first cell in the path that violates the timing performance parameter such that the violation of the timing performance parameter is minimized.

### Claim 9 (depends on 7)

The computer program product of claim 7, wherein the variation of the first netlist includes a derivative cell of a subsequent cell that is in the path after the first cell in the path that violates the timing performance parameter such that the violation of the timing performance parameter is minimized.

### Claim 10 (depends on 7)

The computer program product of claim 7, wherein the computer program code for providing the timing performance of the path includes at least two paths in the final netlist, and wherein the computer program further comprises computer program code for identifying a common path of the at least two paths, wherein the common path comprises the first cell in the path that violates the timing performance parameter.

### Claim 11 (depends on 7)

The computer program product of claim 7, wherein the computer program further comprises computer program code for a loop to provide a modified timing performance of the path in the first netlist as modified in the modified netlist, to identify a second cell in the path to be compensated, and to provide a second modified netlist comprising a variation of the first modified netlist to compensate for the second cell.

### Claim 12 (depends on 7)

The computer program product of claim 7, wherein the final netlist comprises a derivative cell, wherein the derivative cell is a variation of the first cell or a subsequent cell in the path after the first cell.

### Claim 13

A method for providing an adjusted electronic representation of an integrated circuit layout, the method comprising:
generating full node cells from a full node netlist;
scaling the full node cells to provide shrink node cells;
providing a timing performance of the full node cells and the shrink node cells;
comparing the timing performance of the full node cells to the timing performance of the shrink node cells;
generating derivative cells of at least one shrink node cell, wherein each derivative cell comprises a variation of the at least one shrink node cell;
providing a timing performance of the derivative cells;
comparing the timing performance of the derivative cells to the timing performance of the full node cells; and
providing a first netlist comprising at least one derivative cell that minimizes a difference between the timing performance of the at least one shrink node cell and a corresponding full node cell.

### Claim 14 (depends on 13)

The method of claim 13, further comprising:
providing a final layout based on the first netlist; and
processing a semiconductor wafer to form an integrated circuit as indicated by the final layout.

### Claim 15 (depends on 13)

The method of claim 13, wherein the variation includes a marker of the at least one shrink node cell, a dopant implant of the at least one shrink node cell, a gate biasing of the at least one shrink node cell, or an active area biasing of the at least one shrink node cell.

### Claim 16 (depends on 13)

The method of claim 13, wherein the providing a timing performance of the full node cells and the shrink node cells and the providing a timing performance of the derivative cells each comprise providing a delay file comprising a timing performance of the full node cells, the shrink node cells, or the derivative cells.

### Claim 17 (depends on 13)

The method of claim 13, further comprising:
analyzing a timing performance of the first netlist; and
providing modified netlist comprising a modification of the first netlist.

### Claim 18 (depends on 13)

The method of claim 13, wherein the first netlist comprises at least one shrink node cell.

### Claim 19 (depends on 13)

The method of claim 13, further comprising providing a delay file of the first netlist.

### Claim 20

A method for providing an adjusted electronic representation of an integrated circuit layout, the method comprising:
providing a timing performance of a path in a first netlist;
identifying a first cell in the path that violates a timing performance parameter;
providing a first modified netlist comprising a variation of the first netlist to compensate for the first cell in the path that violates the timing performance parameter, wherein the variation includes a first derivative cell of the first cell or a subsequent derivative cell of a subsequent cell that is in the path after the first cell such that the violation of the timing performance parameter is minimized; and
providing a final netlist.

### Claim 21 (depends on 20)

The method of claim 20, further comprising:
providing a final layout based on the final netlist; and
processing a semiconductor wafer to form an integrated circuit as indicated by the final layout.

### Claim 22 (depends on 20)

The method of claim 20, further comprising identifying a common path of the path and another path in the first netlist, wherein the common path comprises the first cell in the path that violates the timing performance parameter.

### Claim 23 (depends on 20)

The method of claim 20, further comprising:
providing a modified timing performance of the path in the first netlist as modified in the modified netlist;
identifying a second cell in the path to be compensated; and
providing a second modified netlist comprising a variation of the first modified netlist to compensate for the second cell.

### Claim 24 (depends on 20)

The method of claim 20, wherein the final netlist comprises a derivative cell, wherein the derivative cell is a variation of the first cell or a subsequent cell in the path after the first cell.
