# US 2025/0103296 A1 · Adder circuit using lookup tables

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

- Number: US 2025/0103296 A1
- Document ID: US20250103296A1
- Status: Published application
- Kind: A1
- Application number: 18/975,807
- Filed: 2024-12-10
- Published: 2025-03-27
- Earliest claimed: 2020-12-28
- Assignees: Achronix Semiconductor Corporation
- Applicants: Achronix Semiconductor Corporation
- Inventors: Christopher C. LaFrieda; Virantha Namal Ekanayake
- Web page: https://patentgrep.com/patent/US20250103296A1

## CPC

- G06F 7/501: Half or full adders, i.e. basic adder cells for one denomination
- G06F 7/575: Basic arithmetic logic units, i.e. devices selectable to perform either addition, subtraction or one of several logical operations, using, at least partially, the same circuitry
- G06F 1/03: working, at least partly, by table look-up (G06F1/025 takes precedence)
- G06F 7/5045: {for multiple operands}
- G06F 7/5057: {using table look-up; using programmable logic arrays (G06F7/509 takes precedence)}
- G06F 7/507: using selection between two conditionally calculated carry or sum values
- H03K 19/20: characterised by logic function, e.g. AND, OR, NOR, NOT circuits (H03K19/003 - H03K19/01 take precedence)
- H03K 19/21: EXCLUSIVE-OR circuits, i.e. giving output if input signal exists at only one input; COINCIDENCE circuits, i.e. giving output only if all input signals are identical
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)

## Abstract

A four-input lookup table (“LUT4”) is modified to operate in a first mode as an ordinary LUT4 and in a second mode as a 1-bit adder providing a sum output and a carry output. A six-input lookup table (“LUT6”) is modified to operate in a first mode as an ordinary LUT6 with a single output and in a second mode as a 2-bit adder providing a sum output and a carry output. Both possible results for the two different possible carry inputs can be determined and selected between when the carry input is available, implementing a 2-bit carry-select adder when in the second mode and retaining the ability to operate as an ordinary LUT6 in the first mode. Using the novel LUT6 design in a circuit chip fabric allows a 2-bit adder slice to be built that efficiently makes use of the LUT6 without requiring additional logic blocks.

## Claims

### Claim 1

A first arithmetic logic unit (ALU) slice comprising:
input connections configured to receive as input a portion of a first operand, a portion of a second operand, a first carry-in bit from a second ALU slice, and a second carry-in bit from a third ALU slice;
a multiplexer controlled by the second carry-in bit; and
output connections configured to provide, as output, a set of sum bits and a carry-out bit, the sum bits containing a sum of the portion of the first operand, the portion of the second operand, and the first carry-in bit.

### Claim 2 (depends on 1)

The first ALU slice of claim 1, wherein the input connections of the first ALU slice are further configured to receive:
a first input bit from the second ALU slice, the first input bit representing the carry-out bit of the second ALU slice if a carry input to the second ALU slice is zero; and
a second input bit from the second ALU slice, the second input bit representing the carry-out bit of the second ALU slice if the carry input to the second ALU slice is one.

### Claim 3 (depends on 2)

The first ALU slice of claim 2, wherein the first input bit and the second input bit are received by the first ALU slice before the second ALU slice receives the carry input to the second ALU slice.

### Claim 4 (depends on 1)

The first ALU slice of claim 1, wherein:
the first ALU slice is configured to provide, as the output, the set of sum bits and the carry-out bit, in a first mode of operations; and
in a second mode of operation, the first ALU slice is configured to:
provide, as output, a first output bit based on the portion of the first operand, the portion of the second operand, and an assumed value of zero for the first carry-in bit, the first output bit being provided before the first carry-in bit is received as input;
provide, as output, a second output bit based on the portion of the first operand, the portion of the second operand, and an assumed value of one for the first carry-in bit, the second output bit being provided before the first carry-in bit is received as input.

### Claim 5 (depends on 1)

The first ALU slice of claim 1, further comprising a plurality of lookup tables (LUTs) that are implemented as components of a single larger LUT.

### Claim 6 (depends on 1)

The first ALU slice of claim 1, wherein a high order bit of the sum bits is an XOR of an output of a lookup table (LUT) with the output of the multiplexer.

### Claim 7 (depends on 1)

The first ALU slice of claim 1, further comprising a lookup table (LUT) that is configured to generate an output that is an XOR of a high bit of the first operand with a high bit of the second operand.

### Claim 8 (depends on 7)

The first ALU slice of claim 7, further comprising a second LUT that is configured to generate an output that is an AND of a low bit of the first operand with a low bit of the second operand.

### Claim 9 (depends on 8)

The first ALU slice of claim 8, further comprising a third LUT that is configured to generate an output that is an OR of:
an AND of the high bit of the first operand with the high bit of the second operand; and
an AND of:
the XOR of the high bit of the first operand with the high bit of the second operand; and
the AND of the low bit of the first operand with the low bit of the second operand.

### Claim 10 (depends on 1)

The first ALU slice of claim 1, further comprising a lookup table (LUT) that is configured to generate an output that is an AND of:
a binary XOR of a low bit of the first operand with a low bit of the second operand; and
an XOR of a high bit of the first operand with a high bit of the second operand.

### Claim 11

A computer-readable medium containing instructions that when executed by a machine, cause the machine to program a field programmable gate array (FPGA) to generate a circuit comprising:
a first arithmetic logic unit (ALU) slice comprising:
input connections configured to receive as input a portion of a first operand, a portion of a second operand, a first carry-in bit from a second ALU slice, and a second carry-in bit from a third ALU slice;
a multiplexer controlled by the second carry-in bit; and
output connections configured to provide, as output, a set of sum bits and a carry-out bit, the sum bits containing a sum of the portion of the first operand, the portion of the second operand, and the first carry-in bit.

### Claim 12 (depends on 11)

The computer-readable medium of claim 11, wherein:
the first ALU slice is configured to provide, as the output, the sum bits and the carry-out bit, in a first mode of operations; and
in a second mode of operation, the first ALU slice is configured to:
provide, as output, a first output bit based on the portion of the first operand, the portion of the second operand, and an assumed value of zero for the first carry-in bit, the first output bit being provided before the first carry-in bit is received as input;
provide, as output, a second output bit based on the portion of the first operand, the portion of the second operand, and an assumed value of one for the first carry-in bit, the second output bit being provided before the first carry-in bit is received as input.

### Claim 13 (depends on 12)

The computer-readable medium of claim 12, wherein the circuit further comprises one or more additional ALU slices including a highest-order ALU slice, such that the circuit generates, as an output of the highest-order ALU slice in the second mode of operation, one of the following values:
a one-bit value that is active if and only if any pair of corresponding bits in the first operand the second operand are active;
a one-bit value that is active if and only if any bit in the first operand or the second operand is active;
a one-bit value that is active if and only if no pairs of corresponding bits in the first operand and the second operand are both active;
a one-bit value that is active if and only if every bit in the first operand and the second operand is not active;
a one-bit value that is active if and only if any pair of corresponding bits in the first operand and the second operand are different; or
a one-bit value that is active if and only if the first operand and the second operand are identical.

### Claim 14 (depends on 11)

The computer-readable medium of claim 11, wherein the input connections of the first ALU slice are further configured to receive:
a first input bit from the second ALU slice, the first input bit representing the carry-out bit of the second ALU slice if a carry input to the second ALU slice is zero; and
a second input bit from the second ALU slice, the second input bit representing the carry-out bit of the second ALU slice if the carry input to the second ALU slice is one.

### Claim 15 (depends on 14)

The computer-readable medium of claim 14, wherein the first input bit and the second input bit are received by the first ALU slice before the second ALU slice receives the carry input to the second ALU slice.

### Claim 16 (depends on 11)

The computer-readable medium of claim 11, wherein the first ALU slice further comprises a plurality of lookup tables (LUTs) that are implemented as components of a single larger LUT.

### Claim 17

A system comprising:
a memory that stores instructions; and
one or more processors configured by the instructions to perform operations comprising:
programming a field programmable gate array (FPGA) to generate a circuit comprising:
a first arithmetic logic unit (ALU) slice comprising:
input connections configured to receive as input a portion of a first operand, a portion of a second operand, a first carry-in bit from a second ALU slice, and a second carry-in bit from a third ALU slice;
a multiplexer controlled by the second carry-in bit; and
output connections configured to provide, as output, a set of sum bits and a carry-out bit, the sum bits containing a sum of the portion of the first operand, the portion of the second operand, and the first carry-in bit.

### Claim 18 (depends on 17)

The system of claim 17, wherein the input connections of the first ALU slice are further configured to receive:
a first input bit from the second ALU slice, the first input bit representing the carry-out bit of the second ALU slice if a carry input to the second ALU slice is zero; and
a second input bit from the second ALU slice, the second input bit representing the carry-out bit of the second ALU slice if the carry input to the second ALU slice is one.

### Claim 19 (depends on 17)

The system of claim 17, wherein:
the first ALU slice is configured to provide, as the output, the sum bits and the carry-out bit, in a first mode of operations; and
in a second mode of operation, the first ALU slice is configured to:
provide, as output, a first output bit based on the portion of the first operand, the portion of the second operand, and an assumed value of zero for the first carry-in bit, the first output bit being provided before the first carry-in bit is received as input;
provide, as output, a second output bit based on the portion of the first operand, the portion of the second operand, and an assumed value of one for the first carry-in bit, the second output bit being provided before the first carry-in bit is received as input.

### Claim 20 (depends on 19)

The system of claim 19, wherein the circuit further comprises one or more additional ALU slices including a highest-order ALU slice, such that the circuit generates, as an output of the highest-order ALU slice in the second mode of operation, one of the following values:
a one-bit value that is active if and only if any pair of corresponding bits in the first operand the second operand are active;
a one-bit value that is active if and only if any bit in the first operand or the second operand is active;
a one-bit value that is active if and only if no pairs of corresponding bits in the first operand and the second operand are both active;
a one-bit value that is active if and only if every bit in the first operand and the second operand is not active;
a one-bit value that is active if and only if any pair of corresponding bits in the first operand and the second operand are different; or
a one-bit value that is active if and only if the first operand and the second operand are identical.
