Loading patent…
AssigneesCentre National de la Recherche Scientifique (CNRS), Universite Cergy-Pontoise, Universitat Politècnica de València
InventorsDavid Declercq, Erbao Li, Francisco Miguel Garcia Herrero, Javier Valls Coquillat
Estimating the term…
An extension to the enhanced serial generalized bit-flipping decoding algorithm (ES-GBFDA) of non-binary LDPC codes by introducing soft information in the check node operation. The application not only considers the most reliable symbol in the syndrome computation, but also takes at least the second most reliable symbol of each incoming message into account. An extended information set is available for the parity-check node update and this allows introducing the concept of weak and strong votes performed by the check node unit. Each variable node can receive two kinds of votes, whose amplitudes can be tuned to the reliability of the syndrome that produces the vote.
A method for decoding a non-binary low density parity-check (NB-LDPC) code defined in a finite field of size q, which is a symbol flipping decoding method using multiple votes performed by the check node unit and transferred to the variable node unit,
The method according to the preceding claim, wherein η≦L, the method comprising a step consisting in that a sorter unit is configured for sorting (A1.3) the differences of extrinsic reliability ΔWnm(j)−ΔWnm2(j) from the highest value to the lowest value for obtaining a sequence ′ of L sorted indices n, the sequence ′ comprising the η locations where Qn(j) is replaced by Qn2(j) in the L+1 test vectors.
The method according to the preceding claim, wherein each variable node taking as input the LLR vector and the vector Wmn(j) combines (A4.1, A4.2) the previous vector Wmn(j−1), the voting symbols Rn0(j) and of R′n(j) and the voting amplitudes v0, v1 through a function F1 for obtaining the vector defined as the intrinsic information Wmn(j).
The method according to the preceding claim, wherein the function F1 is a simple summation of the values of the previous vector Wmn(j−1) at indices indicated by the voting symbols Rn0(j) and of Rni(j) and the voting amplitudes v0, v1.
The method according to the preceding claim, wherein the function F2 is a simple summation of the values of the previous vector Wn(j−1) at indices indicated by the voting) symbols Rn0(j) and of Rni(j) and the voting amplitudes v0, v1.
A decoding apparatus comprising at least one variable node Vn and a at least one check node Cm, said decoder being configured for implementing a method for decoding a non-binary low density parity-check (NB-LDPC) code defined in a finite field of size q, according to one of the preceding claims.
A decoding apparatus according to the preceding claim, said apparatus being configured for implementing check node operations by means of L processing units configured dynamically to compute Rni(j), with i=1, . . . , L, each one of the L processing units share 3×dc inputs that correspond to the symbols Qn1(j),Qn2(j) and to the coefficients of the code, said inputs of each processing unit are combined by means of 2×dc GF multipliers and 2×dc GF adders, said processing units including all the logic necessary to compute L different syndromes as an intermediate step and a variable number of pipeline stages that may vary from 0 to log 2(dc)+2 depending on the speed of said processing unit.
Dependencies are inferred from the claim text.