# US 2008/0098335 A1 · Automatic voltage drop optimization

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

- Number: US 2008/0098335 A1
- Document ID: US20080098335A1
- Status: Published application
- Kind: A1
- Application number: 11/551,149
- Filed: 2006-10-19
- Published: 2008-04-24
- Earliest claimed: 2006-10-19
- Assignees: Sequence Design, Inc.
- Inventors: David L. Allen; Christopher W. Kapral
- Web page: https://patentgrep.com/patent/US20080098335A1

## CPC

- G06F 30/367: Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods
- G06F 2119/06: Power analysis or power optimisation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

To minimize the voltage drops in an electronic circuit, existing instances are moved and decoupling capacitors are automatically inserted according to an algorithm. A model of the voltage drop on a row of gate elements is presented. The model allows for rapid computations of the effect of a particular move or insertion on voltage drop in the circuit.

## Claims

### Claim 1

A method for placement of circuit components comprising:
identifying a first sub-row comprising a bus and a first instance;
identifying at least one candidate operation to apply to the first sub-row;
computing a first metric for each of said at least one candidate operation;
implementing one of said at least one candidate operation based on the computed first metric.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first sub-row further comprises a trunk for supplying a power or ground voltage.

### Claim 3 (depends on 2)

The method of claim 2, wherein the first sub-row comprises a trunk for supplying a power voltage, and a trunk for supplying a ground voltage.

### Claim 4 (depends on 1)

The method of claim 1, wherein one of the at least one candidate operation is adding a decoupling capacitor to the first sub-row.

### Claim 5 (depends on 1)

The method of claim 1, wherein one of the at least one candidate operation is moving the first instance to a second sub-row.

### Claim 6 (depends on 5)

The method of claim 5, wherein moving the first instance to a second sub-row further comprises moving at least one instance on the second sub-row to make space for the first instance.

### Claim 7 (depends on 6)

The method of claim 6, wherein the second sub-row is separated from the first sub-row by no more than a threshold distance.

### Claim 8 (depends on 1)

The method of claim 1, wherein the identifying a first sub-row comprises:
identifying a first intersection between the bus and a first trunk for supplying a power or ground voltage;
identifying a second intersection between the bus and a second trunk for supplying a power or ground voltage; and wherein
the first sub-row further comprises the first intersection and the second intersection.

### Claim 9 (depends on 8)

The method of claim 8, wherein the second intersection is required to be less than a predetermined distance from the first intersection.

### Claim 10 (depends on 1)

The method of claim 1, wherein the first sub-row further comprises a second instance, and one of the at least one candidate operation is moving the second instance to a second sub-row.

### Claim 11 (depends on 1)

The method of claim 1, wherein the first metric is a voltage drop change.

### Claim 12 (depends on 11)

The method of claim 11, wherein computing the voltage drop change comprises subtracting: 1) a voltage drop corresponding to the first instance before performing the candidate operation, from 2) a voltage drop corresponding to the first instance after performing the candidate operation.

### Claim 13 (depends on 12)

The method of claim 12, wherein the implementing one of said at least one candidate operation comprises:
selecting the candidate operation having the most negative voltage drop change from among the at least one candidate operation; and
implementing the selected candidate operation.

### Claim 14 (depends on 13)

The method of claim 13, wherein the first sub-row comprises a second instance, and one of the at least one candidate operation is moving the second instance to a second sub-row, said method further comprising:
for each candidate operation, computing a voltage drop change for each instance in the first and second sub-row;
identifying a second candidate set comprising candidate operations for which each instance in the first and second sub-row have a computed voltage drop change less than a voltage drop goal threshold;
selecting the candidate operation having the most negative voltage drop change from the second candidate set.

### Claim 15 (depends on 14)

The method of claim 14, further comprising computing a second metric for each of said at least one candidate operation, wherein the implementing one of said at least one candidate operation is further based on the computed second metric.

### Claim 16 (depends on 15)

The method of claim 15, wherein the second metric is a placement cost.

### Claim 17 (depends on 14)

The method of claim 14, wherein implementing one of said at least one candidate operation comprises:
identifying a first candidate set comprising candidate operations having a placement cost less than a placement cost threshold;
selecting the candidate operation having the most negative voltage drop change from the first candidate set; and
implementing the selected candidate operation.
