# US 2026/0093882 A1 · Test point insertion at register transfer level

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

- Number: US 2026/0093882 A1
- Document ID: US20260093882A1
- Status: Published application
- Kind: A1
- Application number: 18/903,865
- Filed: 2024-10-01
- Published: 2026-04-02
- Earliest claimed: 2024-10-01
- Assignees: Siemens Industry Software Inc.
- Applicants: Siemens Industry Software Inc.
- Inventors: Nilanjan Mukherjee; Oussama Laouamri
- Web page: https://patentgrep.com/patent/US20260093882A1

## CPC

- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 30/333: Design for testability [DFT], e.g. scan chain or built-in self-test [BIST]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Various aspects of the present disclosed technology relate to techniques for test point insertion at register transfer level for a circuit design. A quick logic synthesis process is performed on an RTL circuit design to generate a gate-level netlist. Gate-level nodes in the gate-level netlist are back-annotated to corresponding locations in the RTL circuit design. Editable areas in the gate-level netlist are determined based on the back-annotation. A test point analysis process is performed on the gate-level netlist to determine gate-level locations for test point insertion in the editable areas. RTL locations for test point insertion in the RTL circuit design corresponding to the gate-level locations for test point insertion are determined based on the back-annotating result. Test points are inserted at the RTL locations for test point insertion to derive a modified RTL circuit design.

## Claims

### Claim 1

A method, executed by at least one processor of a computer, comprising:
receiving an RTL (register-transfer-level) circuit design;
performing a quick logic synthesis process on the RTL circuit design to generate a gate-level netlist;
back-annotating gate-level nodes in the gate-level netlist to corresponding locations in the RTL circuit design;
determining editable areas in the gate-level netlist based on the back-annotating gate-level nodes;
performing a test point analysis process on the gate-level netlist to determine gate-level locations for test point insertion in the editable areas;
determining RTL locations for test point insertion in the RTL circuit design corresponding to the gate-level locations for test point insertion based on the back-annotating gate-level nodes; and
storing information of the RTL locations for test point insertion for modifying the RTL circuit design.

### Claim 2 (depends on 1)

The method recited in claim 1, further comprising:
inserting test points at the RTL locations for test point insertion to derive a modified RTL circuit design; and
performing a full logic synthesis process on the modified RTL circuit design to generate a technology-mapped and fully optimized gate-level netlist.

### Claim 3 (depends on 2)

The method recited in claim 2, further comprising:
inserting additional test points into the technology-mapped and fully optimized gate-level netlist based on a further test point analysis process.

### Claim 4 (depends on 1)

The method recited in claim 1, further comprising:
performs an RTL complexity analysis based on the information of the RTL locations for test point insertion to provide information for designers to adjust the RTL circuit design; and
adjusting the RTL circuit design based on the information for designers to adjust the RTL circuit design.

### Claim 5 (depends on 1)

The method recited in claim 1, wherein the quick Logic synthesis process comprises:
mapping to a generic library.

### Claim 6 (depends on 1)

The method recited in claim 1, wherein the editable areas comprise gate-level nodes that are directly mapped to RTL nets and gate-level nodes that are directly mapped to RTL expression or sub-expression boundaries.

### Claim 7 (depends on 6)

The method recited in claim 6, wherein the editable areas further comprise gate-level nodes that are mapped to RTL locations belonging to functional block objects.

### Claim 8 (depends on 1)

The method recited in claim 1, wherein the gate-level netlist is flattened and represented as a Directed Acyclic Graph (DAG).

### Claim 9

One or more computer-readable media storing computer-executable instructions for causing one or more processors to perform a method, the method comprising:
receiving an RTL (register-transfer-level) circuit design;
performing a quick logic synthesis process on the RTL circuit design to generate a gate-level netlist;
back-annotating gate-level nodes in the gate-level netlist to corresponding locations in the RTL circuit design;
determining editable areas in the gate-level netlist based on the back-annotating gate-level nodes;
performing a test point analysis process on the gate-level netlist to determine gate-level locations for test point insertion in the editable areas;
determining RTL locations for test point insertion in the RTL circuit design corresponding to the gate-level locations for test point insertion based on the back-annotating gate-level nodes; and
storing information of the RTL locations for test point insertion for modifying the RTL circuit design.

### Claim 10 (depends on 9)

The one or more computer-readable media recited in claim 9, wherein the method further comprise:
inserting test points at the RTL locations for test point insertion to derive a modified RTL circuit design; and
performing a full logic synthesis process on the modified RTL circuit design to generate a technology-mapped and fully optimized gate-level netlist.

### Claim 11 (depends on 10)

The one or more computer-readable media recited in claim 10, wherein the method further comprise:
inserting additional test points into the technology-mapped and fully optimized gate-level netlist based on a further test point analysis process.

### Claim 12 (depends on 9)

The one or more computer-readable media recited in claim 9, wherein the method further comprise:
performs an RTL complexity analysis based on the information of the RTL locations for test point insertion to provide information for designers to adjust the RTL circuit design; and
adjusting the RTL circuit design based on the information for designers to adjust the RTL circuit design.

### Claim 13 (depends on 9)

The one or more computer-readable media recited in claim 9, wherein the quick Logic synthesis process comprises:
mapping to a generic library.

### Claim 14 (depends on 9)

The one or more computer-readable media recited in claim 9, wherein the editable areas comprise gate-level nodes that are directly mapped to RTL nets and gate-level nodes that are directly mapped to RTL expression or sub-expression boundaries.

### Claim 15 (depends on 14)

The one or more computer-readable media recited in claim 14, wherein the editable areas further comprise gate-level nodes that are mapped to RTL locations belonging to functional block objects.

### Claim 16 (depends on 9)

The one or more computer-readable media recited in claim 9, wherein the gate-level netlist is flattened and represented as a Directed Acyclic Graph (DAG).

### Claim 17

A system, comprising:
one or more processors, the one or more processors programmed to perform a method, the method comprising:
receiving an RTL (register-transfer-level) circuit design;
performing a quick logic synthesis process on the RTL circuit design to generate a gate-level netlist;
back-annotating gate-level nodes in the gate-level netlist to corresponding locations in the RTL circuit design;
determining editable areas in the gate-level netlist based on the back-annotating gate-level nodes;
performing a test point analysis process on the gate-level netlist to determine gate-level locations for test point insertion in the editable areas;
determining RTL locations for test point insertion in the RTL circuit design corresponding to the gate-level locations for test point insertion based on the back-annotating gate-level nodes; and
storing information of the RTL locations for test point insertion for modifying the RTL circuit design.

### Claim 18 (depends on 17)

The system recited in claim 17, wherein the method further comprise:
inserting test points at the RTL locations for test point insertion to derive a modified RTL circuit design; and
performing a full logic synthesis process on the modified RTL circuit design to generate a technology-mapped and fully optimized gate-level netlist.

### Claim 19 (depends on 17)

The system recited in claim 17, wherein the editable areas comprise gate-level nodes that are directly mapped to RTL nets and gate-level nodes that are directly mapped to RTL expression or sub-expression boundaries.

### Claim 20 (depends on 19)

The system recited in claim 19, wherein the editable areas further comprise gate-level nodes that are mapped to RTL locations belonging to functional block objects.
