# US 2024/0048159 A1 · Error processing and correction of adjacent 2-bit errors

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

- Number: US 2024/0048159 A1
- Document ID: US20240048159A1
- Status: Published application
- Kind: A1
- Application number: 18/355,692
- Filed: 2023-07-20
- Published: 2024-02-08
- Earliest claimed: 2022-07-21
- Assignees: Infineon Technologies AG
- Applicants: Infineon Technologies AG
- Inventors: Jens Rosenbusch; Klaus Oberländer; Georg Duchrau; Michael Goessel
- Web page: https://patentgrep.com/patent/US20240048159A1

## CPC

- 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/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- G06F 11/1028: {Adjacent errors, e.g. error in n-bit (n>1) wide storage units, i.e. package error}
- H03M 13/1575: {Direct decoding, e.g. by a direct determination of the error locator polynomial from syndromes and subsequent analysis or by matrix operations involving syndromes, e.g. for codes with a small minimum Hamming distance}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- 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)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

What is proposed is a solution for processing errors in a sequence of bits, wherein the sequence of bits, in the error-free case, forms a codeword of an error code, wherein the error code is based on an H-matrix or is able to be determined thereby, wherein an error syndrome is determined for the sequence of bits, wherein a link is determined between components of the error syndrome and parts of the H-matrix, and wherein two adjacent bits in the sequence of bits are corrected if the link adopts a predefined value.

## Claims

### Claim 1

A method, comprising:
processing errors in a sequence of bits, wherein the sequence of bits, in an error-free case, forms a codeword of an error code, wherein the error code is based on an H-matrix or is able to be determined by the H-matrix;
determining an error syndrome for the sequence of bits;
determining a link between components of the error syndrome and parts of the H-matrix; and
correcting two adjacent bits in the sequence of bits when the link adopts a predefined value.

### Claim 2 (depends on 1)

The method of claim 1, in which the two adjacent bits in the sequence of bits are corrected and the components of the error syndrome are inverted when the corresponding linked components of columns of the H-matrix have an odd number of ones, and are not inverted when the corresponding linked components of the columns of the H-matrix have an even number of ones.

### Claim 3 (depends on 2)

The method of claim 2, in which the two adjacent bits in the sequence of bits are corrected by way of a correction signal, wherein the correction signal is determined based on a Boolean link between the inverted components of the error syndrome and the non-inverted components of the error syndrome.

### Claim 4 (depends on 3)

The method of claim 3, in which the two adjacent bits in the sequence of bits are corrected when the link adopts a predefined value in a predefined number of components.

### Claim 5 (depends on 4)

The method of claim 4, in which the predefined number of components corresponds to a number that is fewer than all of the predefined number of components.

### Claim 6 (depends on 3)

The method of claim 3, in which the two adjacent bits in the sequence of bits are not corrected when the link does not adopt the predefined value and/or adopts a value different from the predefined value.

### Claim 7 (depends on 1)

The method of claim 1, in which the components of the error syndrome are sub-error syndromes of the error syndrome.

### Claim 8 (depends on 1)

The method of claim 1, in which the parts of the H-matrix are components of the H-matrix,
columns of the H-matrix, and/or
sub-matrices of the H-matrix.

### Claim 9 (depends on 1)

The method of claim 1, in which the two adjacent bits of the sequence of bits are corrected, wherein each of the bits has a bit position that corresponds to a column of the H-matrix.

### Claim 10 (depends on 1)

The method of claim 1, in which components of the error syndrome are linked with parts of the H-matrix by linking the components of the error syndrome with at least two columns of the H-matrix or with components of two columns of the H-matrix.

### Claim 11 (depends on 10)

The method of claim 10, in which the at least two columns of the H-matrix are adjacent to one another.

### Claim 12 (depends on 10)

The method of claim 10, in which components of adjacent columns of the H-matrix are linked with components of the error syndrome.

### Claim 13 (depends on 1)

The method of claim 1, in which the predefined value is equal to a vector r) or equal to a vector I.

### Claim 14 (depends on 1)

The method of claim 1, in which the error code is able to correct at least 2-bit errors.

### Claim 15 (depends on 1)

The method of claim 1, in which the error code is a BCH code, the error syndrome comprises a first sub-error syndrome and a second sub-error syndrome, and components of the first sub-error syndrome are linked with corresponding components of columns of the H-matrix.

### Claim 16 (depends on 3)

The method of claim 3, in which the two adjacent bits of the sequence of bits are corrected simultaneously or at least partially simultaneously.

### Claim 17 (depends on 1)

A computer program product that is able to be loaded directly into a memory of a digital computer and comprises program code portions that are configured to perform acts of the method of claim 1.

### Claim 18 (depends on 1)

A device for processing errors in a sequence of bits, wherein the device has a processing unit that is configured to carry out the acts of the method of claim 1.

### Claim 19 (depends on 18)

The device as claimed in claim 18, wherein the device comprises a memory containing the sequence of bits.

### Claim 20 (depends on 18)

The device as claimed in claim 18, in which the device is a memory or a memory system.
