# US 2026/0029989 A1 · Lower precision operand representation

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

- Number: US 2026/0029989 A1
- Document ID: US20260029989A1
- Status: Published application
- Kind: A1
- Application number: 18/806,559
- Filed: 2024-08-15
- Published: 2026-01-29
- Earliest claimed: 2024-07-26
- Assignees: NVIDIA Corporation
- Applicants: NVIDIA Corporation
- Inventors: Chong YU
- Web page: https://patentgrep.com/patent/US20260029989A1

## CPC

- G06F 7/523: Multiplying only
- G06F 7/483: Computations with numbers represented by a non-linear combination of denominational numbers, e.g. rational numbers, logarithmic number system or floating-point numbers {(G06F7/4806, G06F7/4824, G06F7/49, G06F7/491, G06F7/544 take precedence)}
- G06F 7/5045: {for multiple operands}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Apparatuses, systems, and techniques to simulate high-precision calculations with a series expansion of lower precision tensor cores. In at least one embodiment, one or more multiplication operands of a first precision are represented by a sum of two or more operands of a different precision.

## Claims

### Claim 1

A processor comprising:
one or more circuits to cause one or more multiplication operands of a first precision to be represented by a sum of two or more operands of a different precision.

### Claim 2 (depends on 1)

The processor of claim 1, wherein the two or more operands of the different precision are each represented using a fewer number of bits than the one or more multiplication operands of the first precision.

### Claim 3 (depends on 1)

The processor of claim 1, wherein the sum of the two or more operands of the different precision is represented using a finite series.

### Claim 4 (depends on 1)

The processor of claim 1, wherein the different precision is to be selected based, at least in part, on one or more characteristics of one or more processors that are to perform on or more calculations using the two or more operands of the different precision.

### Claim 5 (depends on 1)

The processor of claim 1, wherein the one or more multiplication operands comprise one or more operands that are able to be multiplied by another operand.

### Claim 6 (depends on 1)

The processor of claim 1, wherein the one or more circuits are further to calculate a difference between the one or more multiplication operands of the first precision and an operand of the two or more operands of the different precision.

### Claim 7 (depends on 6)

The processor of claim 6, wherein the difference between the one or more multiplication operands of the first precision and the operand of the two or more operands of the different precision is represented using the different precision.

### Claim 8

A system comprising:
one or more processors to cause one or more multiplication operands of a first precision to be represented by a sum of two or more operands of a different precision.

### Claim 9 (depends on 8)

The system of claim 8, wherein the two or more operands of the different precision are each represented using a fewer number of bits than the one or more multiplication operands of the first precision.

### Claim 10 (depends on 8)

The system of claim 8, wherein the sum of the two or more operands of the different precision is represented using a finite series.

### Claim 11 (depends on 8)

The system of claim 8, wherein the different precision is to be selected based, at least in part, on one or more characteristics of one or more processors that are to perform on or more calculations using the two or more operands of the different precision.

### Claim 12 (depends on 8)

The system of claim 8, wherein the one or more multiplication operands comprise one or more operands that are able to be multiplied by another operand.

### Claim 13 (depends on 8)

The system of claim 8, wherein the one or more processors are further to calculate a difference between the one or more multiplication operands of the first precision and an operand of the two or more operands of the different precision.

### Claim 14 (depends on 13)

The system of claim 13, wherein the difference between the one or more multiplication operands of the first precision and the operand of the two or more operands of the different precision is represented using the different precision.

### Claim 15

A method comprising:
causing one or more multiplication operands of a first precision to be represented by a sum of two or more operands of a different precision.

### Claim 16 (depends on 15)

The method of claim 15, wherein the two or more operands of the different precision are each represented using a fewer number of bits than the one or more multiplication operands of the first precision.

### Claim 17 (depends on 15)

The method of claim 15, wherein the sum of the two or more operands of the different precision is represented using a finite series.

### Claim 18 (depends on 15)

The method of claim 15, wherein the different precision is to be selected based, at least in part, on one or more characteristics of one or more processors that are to perform on or more calculations using the two or more operands of the different precision.

### Claim 19 (depends on 15)

The method of claim 15, further comprising calculating a difference between the one or more multiplication operands of the first precision and an operand of the two or more operands of the different precision.

### Claim 20 (depends on 15)

The method of claim 15, wherein a difference between the one or more multiplication operands of the first precision and an operand of the two or more operands of the different precision is represented using the different precision.
