# US 2026/0093881 A1 · Cascaded lookup-table mapping for circuit design and implementation

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

- Number: US 2026/0093881 A1
- Document ID: US20260093881A1
- Status: Published application
- Kind: A1
- Application number: 18/899,599
- Filed: 2024-09-27
- Published: 2026-04-02
- Earliest claimed: 2024-09-27
- Assignees: Xilinx, Inc.
- Applicants: Xilinx, Inc.
- Inventors: Fan Zhang; Yen Hsi Lin; Aman Gayasen
- Web page: https://patentgrep.com/patent/US20260093881A1

## CPC

- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 1/03: working, at least partly, by table look-up (G06F1/025 takes precedence)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Computer-implemented technology mapping of a circuit design includes, for a node of a circuit design, generating a plurality of regular cuts and a plurality of super cuts. A regular cut subset that is a subset of the plurality of regular cuts having M highest priorities and a super cut subset that is a subset of the plurality of super cuts having N highest priorities are generated. Each super cut that is incompatible with a cascaded lookup-table (LUT) circuit structure is discarding from the super cut subset. A cut from a group of cuts including the regular cut subset and the super cut subset is selected to implement a portion of the circuit design including the node.

## Claims

### Claim 1

A computer-implemented method of technology mapping a circuit design, the method comprising:
generating, by computer hardware, a plurality of regular cuts and a plurality of super cuts for a node of a circuit design;
generating, by the computer hardware, a regular cut subset that is a subset of the plurality of regular cuts having M highest priorities and a super cut subset that is a subset of the plurality of super cuts having N highest priorities;
discarding, by the computer hardware, from the super cut subset each super cut that is incompatible with a cascaded lookup-table (LUT) circuit structure; and
selecting a cut from a group of cuts including the regular cut subset and the super cut subset to implement a portion of the circuit design including the node.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the regular cut subset and the super cut subset are generated using a common priority function.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein each super cut has a number of inputs exceeding a number of inputs of a single LUT primitive of a target integrated circuit device.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein the number of inputs of each super cut is less than a predetermined upper threshold number of inputs.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the plurality of regular cuts and the plurality of super cuts are stored in a memory device, and wherein the method further comprises:
discarding each regular cut of the plurality of regular cuts that is excluded from the regular cut subset from the memory device and each super cut of the plurality of super cuts that is excluded from the super cut subset from the memory device.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein each incompatible super cut is deleted from the memory device.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, further comprising:
detecting compatibility of each super cut of the super cut subset by detecting whether the super cut includes a qualified free-set cut having a new leaf and a qualified bound-set cut.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein the new leaf corresponds to a cascade input of the cascaded LUT circuit structure.

### Claim 9 (depends on 7)

The computer-implemented method of claim 7, further comprising:
storing the qualified free-set cut and the qualified bound-set cut with the super cut.

### Claim 10

A system, comprising:
a memory capable of storing program instructions; and
a hardware processor capable of performing operations for mapping a circuit design in response to execution of the program instructions, the operations including:
generating a plurality of regular cuts and a plurality of super cuts for a node of a circuit design;
generating a regular cut subset that is a subset of the plurality of regular cuts having M highest priorities and a super cut subset that is a subset of the plurality of super cuts having N highest priorities;
discarding from the super cut subset each super cut that is incompatible with a cascaded lookup-table (LUT) circuit structure; and
selecting a cut from a group of cuts including the regular cut subset and the super cut subset to implement a portion of the circuit design including the node.

### Claim 11 (depends on 10)

The system of claim 10, wherein the regular cut subset and the super cut subset are generated using a common priority function.

### Claim 12 (depends on 10)

The system of claim 10, wherein each super cut has a number of inputs exceeding a number of inputs of a single LUT primitive of a target integrated circuit device.

### Claim 13 (depends on 12)

The system of claim 12, wherein the number of inputs of each super cut is less than a predetermined upper threshold number of inputs.

### Claim 14 (depends on 10)

The system of claim 10, wherein the plurality of regular cuts and the plurality of super cuts are stored in a memory device, and wherein the hardware processor capable of performing further operations comprising:
discarding each regular cut of the plurality of regular cuts that is excluded from the regular cut subset from the memory device and each super cut of the plurality of super cuts that is excluded from the super cut subset from the memory device.

### Claim 15 (depends on 14)

The system of claim 14, wherein each incompatible super cut is deleted from the memory device.

### Claim 16 (depends on 10)

The system of claim 10, wherein the hardware processor capable of performing further operations comprising:
detecting compatibility of each super cut of the super cut subset by detecting whether the super cut includes a qualified free-set cut having a new leaf and a qualified bound-set cut.

### Claim 17 (depends on 16)

The system of claim 16, wherein the new leaf corresponds to a cascade input of the cascaded LUT circuit structure.

### Claim 18 (depends on 16)

The system of claim 16, wherein the hardware processor capable of performing further operations comprising:
storing the qualified free-set cut and the qualified bound-set cut with the super cut.

### Claim 19

A computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the program instructions are executable by computer hardware to cause the computer hardware to initiate executable operations comprising:
generating a plurality of regular cuts and a plurality of super cuts for a node of a circuit design;
generating a regular cut subset that is a subset of the plurality of regular cuts having M highest priorities and a super cut subset that is a subset of the plurality of super cuts having N highest priorities;
discarding from the super cut subset each super cut that is incompatible with a cascaded lookup-table (LUT) circuit structure; and
selecting a cut from a group of cuts including the regular cut subset and the super cut subset to implement a portion of the circuit design including the node.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein each super cut has a number of inputs exceeding a number of inputs of a single LUT primitive of a target integrated circuit device.
