# US 2013/0298090 A1 · Network resistor model analysis tool

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

- Number: US 2013/0298090 A1
- Document ID: US20130298090A1
- Status: Published application
- Kind: A1
- Application number: 13/462,539
- Filed: 2012-05-02
- Published: 2013-11-07
- Earliest claimed: 2012-05-02
- Assignees: LSI Corporation
- Inventors: Joseph A. Gmitter; Shawn Boshart
- Web page: https://patentgrep.com/patent/US20130298090A1

## CPC

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

## Abstract

The invention may be embodied in a network resistor model analysis tool for an Electrical Rule Checking (ERC) system. The network resistor model analysis tool typically includes, but need not be limited to, (i) a recursive, deterministic resistor path algorithm that identifies all valid resistor paths from a start net to a stopping net in a netlist corresponding to an analog circuit, (ii) a programming representation algorithm complete for representing the resistor paths in a programmatic format accessible through an application program interface, and (iii) a recursive, deterministic resistance value algorithm that solves the programmatically represented network to determine a total resistance value for each valid path and each resistor leg in each valid path.

## Claims

### Claim 1

A non-transitory computer readable medium containing computer executable instructions for causing a computer controlled apparatus to perform steps of:
receiving a netlist defining at least a portion of an analog circuit, the netlist including a plurality of parallel resistor paths, the plurality of parallel resistor paths including a plurality of valid paths from a start net to a stopping net within the netlist, each parallel resistor path of the plurality of parallel resistor paths including at least an inner-most branch and an outer branch that contains the inner-most branch;
identifying the plurality of valid paths from the start net to the stopping net in the netlist, wherein each valid path is identified by recursively traversing each parallel resistor path of the netlist until the stopping net is traversed for each parallel resistor path;
recursively traversing the netlist to reduce each valid path to a single resistor value by iteratively solving each branch of each valid path, wherein the inner-most branch of each valid path is solved prior to solving the outer branch of each valid path; and
defining a network resistor model for the analog circuit based upon the single resistor value of each valid path.

### Claim 2 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein the step of identifying the plurality of valid paths from the start net to the stopping net in the netlist further comprises the step of storing a complete representation of each valid path from the start net to the stopping net.

### Claim 3 (depends on 1)

The non-transitory computer readable medium of claim 1, further comprising a step of representing each valid path as a series of resistor structures in which each resistor structure corresponds to a resistor leg in a valid path and comprises:
a hierarchical device name;
a device model name;
a resistance value; and
a connection structure.

### Claim 4 (depends on 3)

The non-transitory computer readable medium of claim 3, further comprising a step of representing the connection structure for each resistor leg in the valid path as a programming representation comprising:
a number of path appearances for the resistor leg; and
a terminal direction list containing a direction indicator corresponding to each path appearance.

### Claim at position 5

5-14. (canceled)

### Claim 15

A method for creating an analog electrical circuit implemented as computer executable instructions executed by a computer, comprising steps of:
receiving a netlist defining at least a portion of an analog circuit, the netlist including a plurality of parallel resistor paths, the plurality of parallel resistor paths including a plurality of valid paths from a start net to a stopping net within the netlist, each parallel resistor path of the plurality of parallel resistor paths including at least an inner-most branch and an outer branch that contains the inner-most branch;
identifying the plurality of valid paths from the start net to the stopping net in the netlist;
recursively traversing the netlist to reduce each valid path to a single resistor value by iteratively solving each branch of each valid path, wherein the inner-most branch of each valid path is solved prior to solving the outer branch of each valid path;
defining a network resistor model for the analog circuit based upon the single resistor value of each valid path; and
designing a physical analog circuit based at least partially upon the network resistor model.

### Claim 16 (depends on 15)

The method of claim 15, wherein the step of identifying the plurality of valid paths from the start net to the stopping net in the netlist further comprises a step of storing a complete representation of each valid path from the start net to the stopping net.

### Claim 17 (depends on 15)

The method of claim 15, further comprising a step of representing each valid path as a series of resistor structures in which each resistor structure corresponds to a resistor leg in a valid path and comprises:
a hierarchical device name;
a device model name;
a resistance value; and
a connection structure.

### Claim 18 (depends on 17)

The method of claim 17, further comprising a step of representing the connection structure for each resistor leg in the valid path as a programming representation comprising:
a number of path appearances for the resistor leg; and
a terminal direction list containing a direction indicator corresponding to each path appearance.

### Claim at position 10

19-20. (canceled)

### Claim 21 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein each valid path is determined to exclude repeated path appearances of an individual resistor.

### Claim 22 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein each valid path is determined to include the start net and the stopping net located at respective beginning and end points of each valid path.

### Claim 23 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein each valid path is determined to exclude non-resistor device types.

### Claim 24 (depends on 1)

The non-transitory computer readable medium of claim 1, further comprising a step of determining whether each valid path is capable of being reduced to a single resistor value.

### Claim 25 (depends on 24)

The non-transitory computer readable medium of claim 24, wherein a valid path is determined to be capable of being reduced to a single resistor value based upon a connection structure of each resistor in the valid path.

### Claim 26 (depends on 15)

The method of claim 15, wherein each valid path is identified by recursively traversing each parallel resistor path of the netlist until the stopping net is traversed for each parallel resistor path.

### Claim 27 (depends on 15)

The method of claim 15, wherein each valid path is determined to exclude repeated path appearances of an individual resistor.

### Claim 28 (depends on 15)

The method of claim 15, wherein each valid path is determined to include the start net and the stopping net located at respective beginning and end points of each valid path.

### Claim 29 (depends on 15)

The method of claim 15, wherein each valid path is determined to exclude non-resistor device types.

### Claim 30 (depends on 15)

The method of claim 15, further comprising a step of determining whether each valid path is capable of being reduced to a single resistor value.

### Claim 31 (depends on 30)

The method of claim 30, wherein a valid path is determined to be capable of being reduced to a single resistor value based upon a connection structure of each resistor in the valid path.
