# US 2026/0088833 A1 · Method for performing parity bit calculation with aid of circuit complexity reduction for performing error correction, and associated apparatus

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

- Number: US 2026/0088833 A1
- Document ID: US20260088833A1
- Status: Published application
- Kind: A1
- Application number: 19/322,728
- Filed: 2025-09-09
- Published: 2026-03-26
- Earliest claimed: 2024-09-25
- Assignees: Realtek Semiconductor Corp.
- Applicants: Realtek Semiconductor Corp.
- Inventors: Po-Wei Ho
- Web page: https://patentgrep.com/patent/US20260088833A1

## CPC

- H03M 13/2942: {wherein a block of parity bits is computed only from combined information bits or only from parity bits, e.g. a second block of parity bits is computed from a first block of parity bits obtained by systematic encoding of a block of information bits, or a block of parity bits is obtained by an XOR combination of sub-blocks of information bits}
- H03M 13/1174: {Parity-check or generator matrices built from sub-matrices representing known block codes such as, e.g. Hamming codes, e.g. generalized LDPC codes}
- H03M 13/19: Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes
- H03M 13/6575: {Implementations based on combinatorial logic, e.g. Boolean circuits}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A method for performing parity bit calculation with aid of circuit complexity reduction for performing error correction and associated apparatus are provided. The method may include: in an error correction circuit adopting a predetermined error correction code, configuring a first set of exclusive OR (XOR) operation circuits among a plurality of XOR operation circuits corresponding to a predetermined codeword length, rather than all XOR operation circuits among the plurality of XOR operation circuits, for reducing circuit complexity of the error correction circuit, where the first set of XOR operation circuits may be a set of optimized XOR operation circuits implemented based on parity bit coverage reduction; and utilizing the first set of XOR operation circuits to perform the parity bit calculation, for performing error correction corresponding to a shorter codeword length, where a smaller XOR operation count and a shorter critical path length can be reached.

## Claims

### Claim 1

A method for performing parity bit calculation with aid of circuit complexity reduction for performing error correction, the method comprising:
in an error correction circuit adopting a predetermined error correction code, configuring a first set of exclusive OR (XOR) operation circuits among a plurality of XOR operation circuits corresponding to a predetermined codeword length, rather than all XOR operation circuits among the plurality of XOR operation circuits, for reducing circuit complexity of the error correction circuit, wherein the first set of XOR operation circuits is a set of optimized XOR operation circuits implemented based on parity bit coverage reduction; and
utilizing the first set of XOR operation circuits to perform the parity bit calculation, for performing error correction corresponding to a shorter codeword length, wherein the shorter codeword length is less than the predetermined codeword length.

### Claim 2 (depends on 1)

The method of claim 1, wherein the predetermined error correction code represents Hamming code.

### Claim 3 (depends on 1)

The method of claim 1, wherein the plurality of XOR operation circuits represent XOR operation circuits conforming to a predetermined parity bit rule of the predetermined error correction code.

### Claim 4 (depends on 3)

The method of claim 3, wherein a first sub-rule in the predetermined parity bit rule comprises a distribution of all data bits and all parity bits in multiple encoded data bits of a first codeword having the predetermined codeword length, with respect to bit positions in the first codeword.

### Claim 5 (depends on 4)

The method of claim 4, wherein regarding data protection of said all data bits in the multiple encoded data bits, a second sub-rule in the predetermined parity bit rule comprises parity bit coverage of said all parity bits in the multiple encoded data bits with respect to said all data bits in the multiple encoded data bits.

### Claim 6 (depends on 3)

The method of claim 3, wherein at least one XOR operation circuit in the first set of XOR operation circuits does not conform to the predetermined parity bit rule, as if having been replaced or swapped with at least one corresponding XOR operation circuit among a second set of XOR operation circuits other than the first set of XOR operation circuits.

### Claim 7 (depends on 1)

The method of claim 1, wherein the predetermined codeword length is equal to (2r−1), wherein r is an integer greater than or equal to two.

### Claim 8 (depends on 1)

The method of claim 1, wherein the plurality of XOR operation circuits represent a plurality of XOR logic gates, and the error correction circuit comprises multiple XOR operation modules, wherein any XOR operation module among the multiple XOR operation modules comprises a portion of XOR operation circuits among the first set of XOR operation circuits.

### Claim 9 (depends on 1)

An error correction circuit implemented according to the method of claim 1, wherein the error correction circuit comprises:
multiple XOR operation modules, arranged to calculate multiple parity bits according to a set of data bits corresponding to the shorter codeword length, for performing error correction of the set of data bits, wherein any XOR operation module among the multiple XOR operation modules comprises a portion of XOR operation circuits among the first set of XOR operation circuits, for calculating a parity bit among the multiple parity bits according to at least one portion of data bits among the set of data bits.

### Claim 10 (depends on 9)

A circuit module that uses the error correction circuit of claim 9, wherein the circuit module comprises the error correction circuit, and the set of data bits represent data bits output or input by the circuit module.
