# US 2005/0240387 A1 · Gate-level netlist reduction for simulating target modules of a design

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

- Number: US 2005/0240387 A1
- Document ID: US20050240387A1
- Status: Published application
- Kind: A1
- Application number: 10/832,226
- Filed: 2004-04-26
- Published: 2005-10-27
- Earliest claimed: 2004-04-26
- Assignees: LSI Logic Corporation
- Inventors: Maurizio Spadari; Stefano Commodaro
- Web page: https://patentgrep.com/patent/US20050240387A1

## CPC

- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for analyzing a circuit design in preparation for a simulation. The method generally includes the steps of (A) marking each of a plurality of modules between a target module of the modules and a top module of the modules in a hierarchy of the circuit design as a first type by traversing upward through the hierarchy starting from the target module, (B) marking each of the modules as a second type where a parent module of the modules is marked as the first type by traversing downward through the hierarchy starting from the top module and (C) marking each of the modules as a third type where the parent module is not marked as the keep type by traversing downward through the hierarchy starting from the top module.

## Claims

### Claim 1

A method for analyzing a circuit design in preparation for a simulation, comprising the steps of:
(A) marking each of a plurality of modules between a target module of said modules and a top module of said modules in a hierarchy of said circuit design as a first type by traversing upward through said hierarchy starting from said target module;
(B) marking each of said modules as a second type where a parent module of said modules is marked as said first type by traversing downward through said hierarchy starting from said top module; and
(C) marking each of said modules as a third type where said parent module is not marked as said keep type by traversing downward through said hierarchy starting from said top module.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising the step of:
marking each of said modules below said target module in said hierarchy as said first type by traversing downward through said hierarchy starting from said target module.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising the step of:
initializing each of said modules as a fourth type indicating no analysis prior to step (A).

### Claim 4 (depends on 1)

The method according to claim 1, further comprising the step of:
reducing a portion of a netlist of said circuit design corresponding to each of said modules marked as said second type to a black-box representation.

### Claim 5 (depends on 4)

The method according to claim 4, wherein said black-box representation consists of at least one input and at least one output.

### Claim 6 (depends on 1)

The method according to claim 1, further comprising the step of:
eliminating a portion of a netlist of said circuit design corresponding to each of said modules marked as said third type.

### Claim 7 (depends on 1)

The method according to claim 1, further comprising a storage medium recording a computer program comprising the steps of claim 1.

### Claim 8

A method for reducing a full netlist of a circuit design in preparation for simulation; comprising the steps of.
(A) generating a plurality of module netlists by parsing said full netlist among a plurality of modules in a hierarchy of said circuit design;
(B) categorizing each of said modules as one of (i) a first type simulated in a full form, (ii) a second type simulated in a black-box form and (iii) a third type not simulated; and
(C) reducing each of said module netlists corresponding to said second type to said black-box form.

### Claim 9 (depends on 8)

The method according to claim 8, further comprising the step of:
generating a reduced netlist from each of said module netlists corresponding only to said first type and said second type after said reducing.

### Claim 10 (depends on 8)

The method according to claim 8, further comprising the step of:
checking at least one input and at least one output of a target module of said modules having said first type for access to stimulate and observe said target module.

### Claim 11 (depends on 8)

The method according to claim 8, further comprising the step of:
generating a report having in human readable form (i) a first number of gates reduced from said full netlist, (ii) a second number of said modules having said second type and (iii) a third number of said modules having said third type.

### Claim 12 (depends on 8)

The method according to claim 8, wherein step (B) comprises the sub-steps of:
initializing said modules to a fourth type indicating no categorization;
popping a first module of said modules from a list of said modules being simulated; and
categorizing said modules based on said first module.

### Claim 13 (depends on 12)

The method according to claim 12, wherein step (B) further comprises the sub-step of:
repeatedly (i) popping a subsequent module of said modules from said list and (ii) categorizing said modules based on said subsequent module until all of said modules from said list have been considered.

### Claim 14 (depends on 8)

The method according to claim 8, further comprising a storage medium recording a computer program comprising the steps of claim 8.

### Claim 15

A method for preparing a circuit design for simulation, comprising the steps of:
(A) categorizing each of a plurality of modules of said circuit design as one of (i) a first type simulated in full form (ii) a second type influencing said first type during simulation and (iii) a third type not influencing said first type during simulation;
(B) reducing a full netlist of said circuit design by eliminating said modules having said third type; and
(C) reducing said full netlist by representing said modules having said second type in a black-box form.

### Claim 16 (depends on 15)

The method according to claim 15, further comprising the step of:
generating a reduced timing database from a full timing database for said circuit design by eliminating timing information corresponding to each of said modules marked as said third type.

### Claim 17 (depends on 16)

The method according to claim 16, further comprising the step of:
simulating said circuit design using only said modules marked as said first type and said second type.

### Claim 18 (depends on 15)

The method according to claim 15, further comprising the step of:
receiving a user input identifying a target module of said modules used as a basis for said reduction of said full netlist.

### Claim 19 (depends on 15)

The method according to claim 15, wherein step (A) comprises the sub-steps of:
initializing said modules to a fourth type indicating no categorization;
popping a first module of said modules from a list of said modules being simulated; and
categorizing said modules based on said first module.

### Claim 20 (depends on 15)

The method according to claim 15, further comprising a storage medium recording a computer program comprising the steps of claim 15.
