# US 2026/0288413 A1 · Computing device and computing method

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

- Number: US 2026/0288413 A1
- Document ID: US20260288413A1
- Status: Published application
- Kind: A1
- Application number: 19/570,627
- Filed: 2026-03-18
- Published: 2026-09-24
- Earliest claimed: 2025-03-21
- Assignees: Preferred Networks, Inc.
- Applicants: Preferred Networks, Inc.
- Inventors: Toru KOIZUMI; Ryota SHIOYA; Takuya YAMAUCHI; Tomoya ADACHI; Ken NAMURA; Junichiro MAKINO
- Web page: https://patentgrep.com/patent/US20260288413A1

## CPC

- G06F 7/49947: {Rounding}
- 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 2207/4824: Neural networks
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computing device includes one or more computing circuits. The one or more computing circuits are configured to perform an arithmetic operation; predict a section of consecutive trailing ones of a first bit sequence representing an arithmetic result of the arithmetic operation; and round the arithmetic result based on the predicted section of the consecutive trailing ones.

## Claims

### Claim 1

A computing device comprising one or more computing circuits, wherein the one or more computing circuits are configured to:
perform an arithmetic operation;
predict a section of consecutive trailing ones of a first bit sequence representing an arithmetic result of the arithmetic operation; and
round the arithmetic result based on the predicted section of the consecutive trailing ones.

### Claim 2 (depends on 1)

The computing device as claimed in claim 1,
wherein the one or more computing circuits compute an exclusive OR of a second bit sequence having ones in at least a section corresponding to the section of the consecutive trailing ones of the first bit sequence and the arithmetic result, and
wherein a result of the exclusive OR is output as a result of the rounding.

### Claim 3 (depends on 2)

The computing device as claimed in claim 2, wherein the one or more computing circuits normalize the second bit sequence and compute the exclusive OR of the normalized second bit sequence and the arithmetic result.

### Claim 4 (depends on 3)

The computing device as claimed in claim 3, wherein the normalization is performed by a bitonic sort.

### Claim 5 (depends on 1)

The computing device as claimed in claim 1, wherein the one or more computing circuits generate a third bit sequence in which only a least significant bit of an effective part of the arithmetic result is one and predict the section of the consecutive trailing ones based on the first bit sequence and a sum of the first bit sequence and the third bit sequence.

### Claim 6 (depends on 5)

The computing device as claimed in claim 5, wherein the one or more computing circuits generate the third bit sequence by predicting a most significant bit of the effective part of the arithmetic result, shifting the first bit sequence such that the most significant bit is at a position of the least significant bit, and masking bits lower than the least significant bit to zero in the shifted first bit sequence.

### Claim 7 (depends on 1)

The computing device as claimed in claim 1, wherein the arithmetic operation includes a floating-point operation.

### Claim 8 (depends on 7)

The computing device as claimed in claim 7, wherein the floating-point operation includes at least one of a multiply-add operation, an addition, or a multiplication.

### Claim 9 (depends on 1)

The computing device as claimed in claim 1, wherein the arithmetic operation includes an operation in a neural network.

### Claim 10 (depends on 1)

The computing device as claimed in claim 1, wherein the one or more computing circuits correct a prediction error of the section of the consecutive trailing ones.

### Claim 11

A computing method comprising:
performing, by one or more computing circuits, an arithmetic operation;
predicting, by the one or more computing circuits, a section of consecutive trailing ones of a first bit sequence representing an arithmetic result of the arithmetic operation; and
rounding, by the one or more computing circuits, the arithmetic result based on a result of predicting the section of the consecutive trailing ones.

### Claim 12 (depends on 11)

The computing method as claimed in claim 11, further comprising:
computing, by the one or more computing circuits, an exclusive OR of a second bit sequence having ones in at least a section corresponding to the section of the consecutive trailing ones of the first bit sequence and the arithmetic result; and
outputting, by the one or more computing circuits, a result of the exclusive OR as a result of the rounding.

### Claim 13 (depends on 12)

The computing method as claimed in claim 12, further comprising:
normalizing, by the one or more computing circuits, the second bit sequence; and
computing, by the one or more computing circuits, the exclusive OR of the normalized second bit sequence and the arithmetic result.

### Claim 14 (depends on 13)

The computing method as claimed in claim 13, wherein the normalization is performed by a bitonic sort.

### Claim 15 (depends on 11)

The computing method as claimed in claim 11, further comprising generating, by the one or more computing circuits, a third bit sequence in which only a least significant bit of an effective part of the arithmetic result is one, wherein
the predicting the section of the consecutive trailing ones is based on the first bit sequence and a sum of the first bit sequence and the third bit sequence.

### Claim 16 (depends on 15)

The computing method as claimed in claim 15, wherein the generating the third bit sequence includes:
predicting, by the one or more computing circuits, a most significant bit of the effective part of the arithmetic result;
shifting, by the one or more computing circuits, the first bit sequence such that the most significant bit is at a position of the least significant bit; and
masking, by the one or more computing circuits, bits lower than the least significant bit to zero in the shifted first bit sequence.

### Claim 17 (depends on 11)

The computing method as claimed in claim 11, wherein the arithmetic operation includes a floating-point operation.

### Claim 18 (depends on 17)

The computing method as claimed in claim 17, wherein the floating-point operation includes at least one of a multiply-add operation, an addition, or a multiplication.

### Claim 19 (depends on 11)

The computing method as claimed in claim 11, wherein the arithmetic operation includes an operation in a neural network.

### Claim 20 (depends on 11)

The computing method as claimed in claim 11, further comprising correcting, by the one or more computing circuits, a prediction error of the section of the consecutive trailing ones.
