Processing

Please wait...

Settings

Settings

Goto Application

1. WO2022003396 - FORWARD ERROR CORRECTION CODING USING A TREE STRUCTURE

Publication Number WO/2022/003396
Publication Date 06.01.2022
International Application No. PCT/IB2020/056183
International Filing Date 30.06.2020
IPC
H03M 13/13 2006.1
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
H03M 13/45 2006.1
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING, DECODING OR CODE CONVERSION, IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03-H03M13/35153
45Soft decoding, i.e. using symbol reliability information
CPC
H03M 13/09
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
H03M 13/098
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
098using single parity bit
H03M 13/1111
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
11using multiple parity bits
1102Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
1105Decoding
1111Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
H03M 13/13
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
H03M 13/136
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
136Reed-Muller [RM] codes
H03M 13/1515
HELECTRICITY
03BASIC ELECTRONIC CIRCUITRY
MCODING; DECODING; CODE CONVERSION IN GENERAL
13Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
05using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
13Linear codes
15Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
151using error location or error correction polynomials
1515Reed-Solomon codes
Applicants
  • CIENA CORPORATION [US]/[US]
  • ROBERTS, Kim [CA]/[CA] (HN)
Inventors
  • ROBERTS, Kim
  • OVEIS GHARAN, Shahab
  • SEIFI, Mohammad Ehsan
Agents
  • INTEGRAL IP
  • SCOUTEN, Amy
  • PATON, Miriam
Priority Data
Publication Language English (en)
Filing Language English (EN)
Designated States
Title
(EN) FORWARD ERROR CORRECTION CODING USING A TREE STRUCTURE
(FR) CODAGE DE CORRECTION D'ERREUR SANS VOIE DE RETOUR À L'AIDE D'UNE STRUCTURE ARBORESCENTE
Abstract
(EN) A transmitter (200) generates (602) an encoded vector (404) by encoding (406) a data vector (402), the encoded vector representing payload information and parity information. The encoding is mathematically equivalent to calculating three or more forward error correction (FEC) codewords from the data vector and then calculating the encoded vector from the codewords, at least one codeword being calculated from at least one recursion of a mathematical operation, and at least one codeword comprising more than 6 terms. The transmitter transmits (604) a signal representing the encoded vector over a communication channel. A receiver (300) determines (702) a vector estimate (502) from the signal and recovers (716) the data vector from the vector estimate by sequentially decoding (706, 710, 714) the codewords, wherein at least one codeword that is decoded earlier in the decoding enhances an estimate of at least one codeword that is decoded later in the decoding.
(FR) La présente invention concerne un émetteur (200) qui génère (602) un vecteur codé (404) par codage (406) d'un vecteur de données (402), le vecteur codé représentant des informations de charge utile et des informations de parité. Le codage est mathématiquement équivalent à calculer trois ou plus de trois mots de code de correction d'erreur sans voie de retour (FEC) à partir du vecteur de données, puis à calculer le vecteur codé à partir des mots de code, au moins un mot de code étant calculé à partir d'au moins une récursion d'une opération mathématique, et au moins un mot de code comprenant plus de 6 termes. L'émetteur émet (604) un signal représentant le vecteur codé sur un canal de communication. Un récepteur (300) détermine (702) une estimation vectorielle (502) à partir du signal et récupère (716) le vecteur de données à partir de l'estimation de vecteur par décodage séquentiel (706, 710, 714) des mots de code, au moins un mot de code qui est décodé plus tôt dans le décodage améliorant une estimation d'au moins un mot de code qui est décodé plus tard dans le décodage.
Related patent documents
Latest bibliographic data on file with the International Bureau