Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020115070 - ITERATIVE DECODER FOR DECODING A CODE COMPOSED OF AT LEAST TWO CONSTRAINT NODES

Publication Number WO/2020/115070
Publication Date 11.06.2020
International Application No. PCT/EP2019/083544
International Filing Date 03.12.2019
IPC
H03M 13/11 2006.01
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
11using multiple parity bits
CPC
H03M 13/1117
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
1117using approximations for check node processing, e.g. an outgoing message is depending on the signs and the minimum over the magnitudes of all incoming messages according to the min-sum rule
H03M 13/6577
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
65Purpose and implementation aspects
6577Representation or format of variables, register sizes or word-lengths and quantization
Applicants
  • UNIVERSITE DE BRETAGNE SUD [FR]/[FR]
Inventors
  • COCHACHIN HENOSTROZA, Franklin
  • BOUTILLON, Emmanuel
Agents
  • NOVAGRAAF TECHNOLOGIES
Priority Data
18306599.403.12.2018EP
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) ITERATIVE DECODER FOR DECODING A CODE COMPOSED OF AT LEAST TWO CONSTRAINT NODES
(FR) DÉCODEUR ITÉRATIF POUR DÉCODER UN CODE COMPOSÉ D'AU MOINS DEUX NŒUDS DE CONTRAINTE
Abstract
(EN)
An iterative decoder configured for decoding a code having a codeword length N, comprises: • N variable nodes (VNs) vn, n = 1...N, configured to receive a LLR In defined on a alphabet AI of qch quantization bits, qch ≥2; • M constraint nodes (CNs) cm, m = 1...M, 2 ≤ M < N; • vn and cm exchanging messages along edges of a Tanner graph; • each vn sending messages mvncm to cm, the set of connected constraint nodes being noted V(vn), and V(vn)\{cm} being V(vn) except cm, and, • each cm sending messages mcmvn to vn; • the LLR In and the messages mvncm and mcm→vn are coded according to a sign-and-magnitude code; and • each variable node vn, for each iteration l, compute: • sign-preserving factors: (formula I) where ξ is a positive or a null integer; •(formula II) and (formula III) where S is a function from the set of value that can take floor (formula IV) to the set As.
(FR)
Un décodeur itératif configuré pour décoder un code ayant une longueur de mot de code N comprend : • N nœuds variables (VN) vn, n = 1...N, configuré pour recevoir un LLR In défini sur un alphabet A I de qch bits de quantification, qch ≥2 ; • M nœuds de contrainte (CN) cm, m = 1...M, 2 ≤ M < N ; • vn et cm échangeant des messages le long des bords d'un graphe de Tanner ; • chaque vn envoyant des messages m vn cm toc m , l'ensemble de nœuds de contrainte connectés étant noté V(vn), et V(vn)\{cm} étant V(vn) à l'exception de cm, et, • chaque cm envoyant des messages m cm vn à vn ; • le LLR In et les messages m vn cm et m cm→vn étant codés selon un code de signe et d'amplitude ; et • chaque nœud variable vn, pour chaque itération l, calculant : • les facteurs de conservation de signe : (formule I) où ξ est un nombre entier positif ou nul ; • (formule II) et (formule III) où S est une fonction de l'ensemble de valeurs qui peut occuper (formule IV) sur l'ensemble A s .
Latest bibliographic data on file with the International Bureau