# US 2010/0306724 A1 · Method of incremental statistical static timing analysis based on timing yield

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

- Number: US 2010/0306724 A1
- Document ID: US20100306724A1
- Status: Published application
- Kind: A1
- Application number: 12/475,545
- Filed: 2009-05-31
- Published: 2010-12-02
- Earliest claimed: 2009-05-26
- Assignees: Postech Academy-Industry Foundation
- Inventors: Jinwook Kim; Young Hwan Kim; Wook Kim
- Web page: https://patentgrep.com/patent/US20100306724A1

## CPC

- G06F 30/3312: Timing analysis
- G06F 2119/12: Timing analysis or timing optimisation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Provided is a method of incremental SSTA (statistical static timing analysis) of a digital circuit, the method including a first step in which, when a gate is replaced in the digital circuit, delay propagation is performed from a node of a replaced gate to a virtual sink node based on SSTA; a second step in which, if a changed value of a gate timing yield at each gate which propagates delay toward the virtual sink node is smaller than a predetermined threshold value, delay propagation with respect to a fanout gate of the corresponding gate is stopped; and a third step in which, when a delay with respect to the node of the replaced gate is propagated to the virtual sink node, a new timing yield is calculated at the virtual sink node.

## Claims

### Claim 1

A method of incremental SSTA (statistical static timing analysis) of a digital circuit, the method comprising:
a first step in which, when a gate is replaced in the digital circuit, delay propagation is performed from a node of a replaced gate to a virtual sink node based on SSTA;
a second step in which, if a changed value of a gate timing yield at each gate which propagates delay toward the virtual sink node is smaller than a predetermined threshold value, delay propagation with respect to a fanout gate of the corresponding gate is stopped; and
a third step in which, when a delay with respect to the node of the replaced gate is propagated to the virtual sink node, a new timing yield is calculated at the virtual sink node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the timing yield of a gate is calculated according to an equation
Gate


Timing


Yield
=
Φ

(
μ
i
σ
i
)
,
where Φ indicates a cumulative distribution function of a standard normal distribution, and μi and σi indicate a mean deviation and a standard deviation of timing slack at an arbitrary gate i.

### Claim 3 (depends on 1)

The method of claim 1, wherein the predetermined threshold value is set based on an allowable maximum error value of a timing yield in the digital circuit.
