# US 2026/0244400 A1 · Circuit of adder tree and method of operating the same

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

- Number: US 2026/0244400 A1
- Document ID: US20260244400A1
- Status: Published application
- Kind: A1
- Application number: 19/054,098
- Filed: 2025-02-14
- Published: 2026-08-20
- Earliest claimed: 2025-02-14
- Assignees: Taiwan Semiconductor Manufacturing Company, Ltd.; National Tsing Hua University
- Applicants: Taiwan Semiconductor Manufacturing Company, Ltd.; National Tsing Hua University
- Inventors: Win-San KHWA; Jun-Ming HSU; Ping-Chun WU; Meng-Fan CHANG
- Web page: https://patentgrep.com/patent/US20260244400A1

## CPC

- G06F 7/501: Half or full adders, i.e. basic adder cells for one denomination
- H03K 19/08: using semiconductor devices (H03K19/173 takes precedence; wherein the semiconductor devices are only diode rectifiers H03K19/12)
- H03K 19/1737: {using multiplexers (H03K19/1738 takes precedence)}
- 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
- H03K 19/215: {using field-effect transistors}
- 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 circuit is provided. The circuit comprises first and second plurality of tree structures of adders. The first plurality of tree structures perform additions of bits lower than a place value of a plurality of numbers. The adders in the first plurality of tree structures generate full swing outputs. The second plurality of tree structures of adders are coupled to the first plurality of tree structures of adders. The second plurality of tree structures perform additions of bits equal to or higher than the place value of the plurality of numbers. The second plurality of tree structures include transistors fewer than transistors of the first plurality of tree structures. One of the adders in the second plurality of tree structures generates a non full swing output in response to bits inputted to the adder in the second plurality of tree structures matching a pattern.

## Claims

### Claim 1

A circuit, comprising:
a first plurality of tree structures of adders, wherein the first plurality of tree structures are configured to perform additions of bits of a plurality of numbers having place values lower than a predetermined place value;
wherein the adders in the first plurality of tree structures are configured to generate full swing outputs; and
a second plurality of tree structures of adders coupled to the first plurality of tree structures of adders, wherein the second plurality of tree structures are configured to perform additions of bits of the plurality of numbers having place values equal to or higher than the predetermined place value,
wherein the second plurality of tree structures include transistors fewer than transistors of the first plurality of tree structures,
wherein one of the adders in the second plurality of tree structures is configured to generate a non full swing output in response to bits inputted to the adder in the second plurality of tree structures matching a pattern.

### Claim 2 (depends on 1)

The circuit of claim 1, wherein each of the adders of a first tree structure corresponding to a lower place value in the first and second plurality of tree structures is configured to generate carry bits to a corresponding one of the adders of a second tree structure corresponding to a higher place value in the first and second plurality of tree structures.

### Claim 3 (depends on 1)

The circuit of claim 1, wherein each tree structure in the first plurality of tree structures includes a first layer of first adders and a second layer of second adders receiving outputs of the first layer of the first adders,
wherein an amount of transistors of one of the first adders is greater than an amount of transistors of one of the second adders.

### Claim 4 (depends on 2)

The circuit of claim 2, wherein each of the second adders comprises an inverter configured to transfer a supply voltage to an output terminal of the second adder.

### Claim 5 (depends on 1)

The circuit of claim 1, wherein the second plurality of tree structures include a plurality of first adders and a plurality of second adders, wherein a first amount of transistors in each of the first adders is smaller than a second amount of transistors in each of the second adders.

### Claim 6 (depends on 5)

The circuit of claim 5, wherein one of the first adders comprises:
a first XOR gate coupled to first and second input terminals of the first adder;
a second XOR gate coupled between the first XOR gate and an output terminal of the first adder; and
a multiplexer configured to select among a voltage of the second input terminal and a voltage of an input carry bit to generate a voltage of an output carry bit according to a first output voltage of the first XOR gate.

### Claim 7 (depends on 6)

The circuit of claim 6, wherein the first XOR gate comprises:
a first transistor coupled between the second input terminal and the first output voltage;
a second transistor coupled between the first output voltage and a voltage inverted to a voltage at second input terminal; and
a third transistor coupled between the first input terminal and the second input terminal.

### Claim 8 (depends on 7)

The circuit of claim 7, wherein the second XOR gate comprises:
a fourth transistor coupled between the first output voltage and the output terminal;
a fifth transistor coupled between the output terminal and a voltage inverted to the first output voltage; and
a sixth transistor coupled between the output terminal and the voltage of the input carry bit.

### Claim 9 (depends on 6)

The circuit of claim 6, wherein the multiplexer comprises:
a first transistor coupled between the second input terminal and the voltage of the output carry bit;
a second transistor coupled between the voltage of the input carry bit and the voltage of the output carry bit, wherein gate terminals of the first and second transistor are coupled together; and
a third transistor coupled between the voltage of the input carry bit and the voltage of the output carry bit, wherein a gate terminal of the third transistor is coupled to the first output voltage.

### Claim 10 (depends on 5)

The circuit of claim 5, wherein each of the second adders comprises:
a first XNOR gate coupled to a first input terminal of the first adder and a voltage of an input carry bit;
a first inverter coupled to an output terminal of the first adder;
a second XNOR gate coupled between the first XNOR gate and the first inverter; and
a multiplexer configured to select among a voltage of the first input terminal and a voltage of a second input terminal of the first adder for generating a voltage of an output carry bit according to a first output voltage of the first XNOR gate.

### Claim 11 (depends on 10)

The circuit of claim 10, wherein the first XNOR gate comprises:
a first transistor coupled between the first output voltage and a voltage inverted to the voltage of the first input terminal;
a second transistor coupled between the first output voltage and the voltage of the first input terminal; and
a third transistor coupled between the first output voltage the voltage of the input carry bit.

### Claim 12 (depends on 11)

The circuit of claim 11, wherein the second XNOR gate comprises:
a fourth transistor coupled between the first inverter and a voltage inverted to the voltage of the second input terminal;
a fifth transistor coupled between the first inverter and the voltage of the second input terminal; and
a sixth transistor coupled between the first inverter and a voltage inverted to the first output voltage.

### Claim 13 (depends on 10)

The circuit of claim 10, wherein the multiplexer comprises:
a first transistor coupled to the voltage inverted to the voltage of the second input terminal;
a second transistor coupled to a voltage inverted to the voltage of the first input terminal, wherein gate terminals of the first and second transistor are coupled together to the voltage inverted to the first output voltage; and
a third transistor coupled between the voltage inverted to the voltage of the first input terminal and a gate terminal of the third transistor is coupled to the first output voltage.

### Claim 14

A circuit, comprising:
a plurality tree structures of adders, wherein one of the tree structure comprises:
first layers of first adders and second layers of second adders that are arranged alternately,
wherein one of the first adders comprises an n type transistor or a p type transistor that are coupled between a first supply voltage and a second supply voltage lower than the first supply voltage,
wherein the n type transistor is configured to transmit the first supply voltage in response to bits inputted to the first adder matching a pattern, and the p type transistor is configured to transmit the second supply voltage in response to the bits inputted to the first adder matching the pattern,
wherein an amount of transistors of each of the first adders is smaller than an amount of transistors of each of the second adders.

### Claim 15 (depends on 14)

The circuit of claim 14, wherein one of the first adders comprises:
a first inverter;
a first XOR gate coupled between the first inverter and first and second input terminals of the first adder;
a second XOR gate coupled between the first inverter and an output terminal of the first adder; and
a MUX configured to select from a voltage of the second input terminal and a voltage of an input carry bit to generate a voltage of an output carry bit.

### Claim 16 (depends on 15)

The circuit of claim 15, wherein the first inverter comprises:
a first transistor coupled between the first supply voltage and the second XOR gate; and
a second transistor coupled between the second supply voltage and the second XOR gate.

### Claim 17 (depends on 14)

The circuit of claim 14, wherein each of the second adders comprises:
a first XNOR gate coupled to a first input terminal of the first adder and a voltage of an input carry bit;
a first inverter coupled to the first XNOR gate;
a second inverter coupled to an output terminal of the first adder;
a second XNOR gate coupled between the first inverter and the second inverter; and
a multiplexer configured to select among a voltage of the first input terminal and a voltage of a second input terminal of the first adder for generating a voltage of an output carry bit according to a first output voltage of the first XNOR gate.

### Claim 18 (depends on 17)

The circuit of claim 17, wherein the first inverter comprises:
a first transistor coupled between the first supply voltage and the second XNOR gate; and
a second transistor coupled between the second supply voltage and the second XNOR gate.

### Claim 19

A method, comprising:
performing additions of bits having place values lower than a first place value of a plurality of numbers through a first plurality of tree structures of adders;
generating a first plurality of outputs through the first plurality of tree structures according to the additions of the bits having the place values lower than the place value;
performing additions of bits having place values equal to or higher than the place value of the plurality of numbers through a second plurality of tree structures of adders; and
generating a second plurality of outputs through the second plurality of tree structures according to the additions of bits having the place values equal to or higher than the place value,
wherein the first and second plurality of outputs correspond to bits of an addition result of the plurality of numbers,
wherein the second plurality of outputs are non full swing outputs according to the bits having place values equal to or higher than the place value of the plurality of numbers.

### Claim 20 (depends on 19)

The method of claim 19, comprising:
generating carry bits through the adders of a first tree structure corresponding to a highest place value in the first plurality of tree structures;
receiving the carry bits through the adders of a second tree structure corresponding to a lowest place value in the second plurality of tree structure; and
performing additions between the carry bits and bits corresponding to the lowest place value in the plurality of numbers through the adders of the second tree structure.
