# US 2024/0204913 A1 · Systems and methods for executing forward error correction decoding using a guessing random additive noise decoding algorithm

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

- Number: US 2024/0204913 A1
- Document ID: US20240204913A1
- Status: Published application
- Kind: A1
- Application number: 18/067,259
- Filed: 2022-12-16
- Published: 2024-06-20
- Earliest claimed: 2022-12-16
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Yoones HASHEMI TOROGHI; Bashirreza KARIMI; Hamid EBRAHIMZAD; Ali FARSIABI
- Web page: https://patentgrep.com/patent/US20240204913A1

## CPC

- H04L 1/0052: {Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Forward Error Correction decoding is executed by acquiring a stream of real data symbols from a communication medium, the stream of real data symbols being arranged in a real matrix. Virtual data symbols are generated and arranged in a virtual matrix by applying an interleaver map onto the real matrix. Codewords formed by a main matrix formed by the real matrix and the virtual matrix are iteratively decoded, an iteration of the decoding comprising identifying a set of consecutive received rows of the main matrix, accessing a set of pre-determined reference codewords and in response to determining that a given codeword of the set of consecutive received rows does not match any pre-determined reference codewords, executing a GRAND algorithm on the given codeword, the GRAND algorithm generating a substitute codeword for the given codeword. A system comprising a processor and a memory executes the Forward Error Correction decoding.

## Claims

### Claim 1

A method of executing Forward Error Correction (FEC) decoding, the method being executable by a processor, the method comprising:
acquiring a stream of real data symbols from a non-transitory communication medium, the stream of real data symbols being arranged in a real matrix such that a given real data symbol is associated with a respective real row position and a respective real column position in the real matrix;
generating virtual data symbols being arranged in a virtual matrix such that a given virtual data symbol is associated with a respective virtual row position and a respective virtual column position in the virtual matrix, the generating including applying an interleaver map onto the real matrix,
forming a main matrix by horizontally concatenating the real matrix and the virtual matrix; and
iteratively decoding codewords formed by the main matrix, each codeword being represented by a given row of virtual data symbols in the virtual matrix and a corresponding row of real data symbols in the real matrix, an iteration of the decoding comprising:
identifying a set of M consecutive received rows of the main matrix, M being in positive integer greater than or equal to two;
accessing a set of pre-determined reference codewords; and
in response to determining that a given codeword of the set of M consecutive received rows does not match any pre-determined reference codewords, executing a decoding algorithm on the given codeword, the decoding algorithm generating a substitute codeword for the given codeword.

### Claim 2 (depends on 1)

The method of claim 1, wherein the real matrix and the virtual matrix respectively represent a real buffer and a virtual buffer of a zipper coding scheme.

### Claim 3

(canceled)

### Claim 4

(canceled)

### Claim 5 (depends on 1)

The method of claim 1, wherein the non-transitory communication medium is an optical communication medium.

### Claim 6 (depends on 1)

The method of claim 1, wherein the real data symbols form a component code coded using a coding protocol, the coding protocol being selected among a group of coding protocol comprising: cyclic redundancy check (CRC) protocol, Bose-Chaudhuri-Hocquenghem (BCH) protocol, Polar coding protocol, Low-density parity-check (LDPC) protocol and Reed-Solomon (RS) protocol.

### Claim 7 (depends on 1)

The method of claim 1, wherein executing the GRAND decoding algorithm on the given codeword comprises:
accessing a set of pre-defined Test Error Patterns (TEPs);
applying each of the pre-defined TEPs to bits of the given codeword, each TEP applied to the given codeword causing generation of a codeword variation of the given codeword; and
in response to a given codeword variation being identified as matching a pre-determined reference codeword, defining the substitute codeword based on the given codeword variation.

### Claim 8 (depends on 7)

The method of claim 7, wherein:
each TEP is associated with a corresponding priority level; and
generating the substitute codeword for the given codeword further comprises, in response to a plurality of codeword variations caused by application of a corresponding plurality of TEPs being identified as matching a plurality of corresponding pre-determined reference codewords, defining the substitute codeword based on a codeword variation that has been generated by application of a TEP having a highest priority level among the plurality of TEPs.

### Claim 9 (depends on 1)

The method of claim 1, further comprising replacing the given codeword by the substitute codeword in the main matrix.

### Claim 10 (depends on 9)

The method of claim 9, further comprising updating the main matrix through the interleaver map based on the substitute codeword.

### Claim 11

A system for executing Forward Error Correction (FEC) decoding, the system comprising:
a processor;
a memory configured to store instructions which, upon being executed by the processor, cause the processor to:
acquire a stream of real data symbols from a non-transitory communication medium, the stream of real data symbols being arranged in a real matrix such that a given real data symbol is associated with a respective real row position and a respective real column position in the real matrix;
generate virtual data symbols being arranged in a virtual matrix such that a given virtual data symbol is associated with a respective virtual row position and a respective virtual column position in the virtual matrix, the generating including applying an interleaver map onto the real matrix;
form a main matrix by horizontally concatenating the real matrix and the virtual matrix; and
iteratively decode codewords formed by the main matrix, each codeword being represented by a given row of virtual data symbols in the virtual matrix and a corresponding row of real data symbols in the real matrix, an iteration of the decoding comprising:
identifying a set of M consecutive received rows of a main matrix, M being in positive integer greater than or equal to two;
accessing a set of pre-determined reference codewords;
in response to determining that a given codewords of the set of M consecutive received rows does not match any pre-determined reference codewords, executing a decoding algorithm on the given codeword, the decoding algorithm generating a substitute codeword for the given codeword.

### Claim 12 (depends on 11)

The system of claim 11, wherein the real matrix and the virtual matrix respectively represent a real buffer and a virtual buffer of a zipper coding scheme.

### Claim 13

(canceled)

### Claim 14

(canceled)

### Claim 15 (depends on 11)

The system of claim 11, wherein the non-transitory communication medium is an optical communication medium.

### Claim 16 (depends on 11)

The system of claim 11, wherein the real data symbols form a component code coded using a coding protocol, the coding protocol being selected among a group of coding protocol comprising: cyclic redundancy check (CRC) protocol, Bose-Chaudhuri-Hocquenghem (BCH) protocol, Polar coding protocol, Low-density parity-check (LDPC) protocol and Reed-Solomon (RS) protocol.

### Claim 17 (depends on 11)

The system of claim 11, wherein the processor is further configured to execute the decoding algorithm on the given codeword by:
accessing a set of pre-defined Test Error Patterns (TEPs);
applying each of the pre-defined TEPs to bits of the given codeword, each TEPs applied to the given codeword corresponding to a codeword variation of the given codeword; and
in response to a given codeword variation being identified as matching a pre-determined reference codewords, defining the substitute codeword as the given codeword variation.

### Claim 18 (depends on 17)

The system of claim 17, wherein:
each TEP is associated with a corresponding priority level; and
the processor is further configured to generate the substitute codeword for the given codeword by, in response to a plurality of codeword variations caused by application of a corresponding plurality of TEPs being identified as matching a plurality of corresponding pre-determined reference codewords, defining the substitute codeword based on a codeword variation that has been generated by application of a TEP having a highest priority level among the plurality of TEPs.

### Claim 19 (depends on 11)

The system of claim 11, wherein the processor is further configured to replace the given codeword by the corresponding substitute codeword in the real matrix.

### Claim 20 (depends on 19)

The system of claim 19, wherein the processor is further configured to update the main matrix through the interleaver map based on the substitute codeword.
