# US 2022/0021400 A1 · Iterative decoder for decoding a code composed of at least two constraint nodes

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

- Number: US 2022/0021400 A1
- Document ID: US20220021400A1
- Status: Published application
- Kind: A1
- Application number: 17/299,461
- Filed: 2019-12-03
- Published: 2022-01-20
- Earliest claimed: 2018-12-03
- Assignees: Universite De Bretagne Sud
- Applicants: Université de Bretagne Sud
- Inventors: Emmanuel BOUTILLON; Franklin Rafael COCHACHIN HENOSTROZA
- Web page: https://patentgrep.com/patent/US20220021400A1

## CPC

- H03M 13/1117: {using 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/1128: {Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations}
- H03M 13/1131: {Scheduling of bit node or check node processing}
- H03M 13/3927: {Log-Likelihood Ratio [LLR] computation by combination of forward and backward metrics into LLRs}
- H03M 13/6577: {Representation or format of variables, register sizes or word-lengths and quantization}
- 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)

## Abstract

An iterative decoder, comprises: N variable nodes (VNs) vn, n=1 . . . N, configured to receive a LLR In defined on a alphabet Al 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 mvn→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 mcm→vn to vn; the LLR In and the messages mvn→cm and mcm→vn are coded; and each variable node vn, for each iteration l, compute: sign-preserving factors: = ξ × sign ⁢ ⁢ ( I n ) + ∑ c ∈ V ⁡ ( v n ) ⁢ \ ⁢ { c m } ⁢ ⁢ sign ⁢ ⁢ ( ) where ξis a positive or a null integer; = I n + 1 2 × + ∑ c ∈ V ⁡ ( v n ) ⁢ \ ⁢ { c m } ⁢ ( ) and =(sign(), (floor(abs()))) where S is a function from the set of value that can take floor (abs()) to the set As.

## Claims

### Claim 1

Iterative decoder configured for decoding a code composed of at least two constraint nodes and having a codeword length N, said decoder comprising:
N variable nodes (VNs) vn, n=1 . . . N, each variable node vn being configured to receive a log-likelihood ratio LLR In of the channel decoded bit n of the codeword to be decoded, said LLR In being defined on a alphabet AL of qch quantization bits, qch being an integer equal or greater than 2;
M constraint nodes (CNs) cm, m=1 . . . M, 2≤M>N;
the variable nodes and the constraint nodes being the nodes of a Tanner graph; variable nodes and constraint nodes being configured to exchange messages along edges of the Tanner graph;
each variable node vn being configured for estimating the value yn of the nth bit of the codeword to be decoded and for sending messages mvn→cm, messages belonging to an alphabet As of q quantization bits, q ≤qch, to the connected constraint nodes cm, the set of connected constraint nodes being noted V(vn), defining the degree dv of the variable node vn, as the size of the set V(vn), and V(vn)\{cm} being the set V(vn) except the constraint node cm, and then,
each constraint nodes cm being configured for testing the received message contents with predetermined constraints and sending messages mcm→vn, messages belonging to an alphabet Ac to the connected variable nodes vn;
the message emissions being repeated until the decoding of the codeword is achieved successfully or a predetermined number of iteration is reached; and
the LLR In and the messages mvn→cm and mcm→vn are coded according to a sign-and-magnitude code in the alphabets AL, As and Ac symmetric around zero, AL={−Nqch, . . . ,−1,−0,+0,+1, . . . ,+Nqch}, As={−Nq, . . . ,−1,−0,+0,+1, . . . ,+Nq}, Ac={−Nq′, . . . ,−1,−0,+0,+1, . . . ,+Nq′}in which the sign indicates the estimated bit value and the magnitude represents its reliability; and
each variable node vn, for each iteration l, is configured to compute:
sign-preserving factors, sum of the ponderated sign of LLR In and the sum of the signs of all messages, except for the message coming from cm, received from the connected constraint nodes at iteration I:
=ξ×sign(In)+Σc∈V(vn)\{cm} sign () where ξ is a positive or a null integer;
messages to connected constraint nodes cm for iteration I+1 computed in two steps
=In+1/2×+Σc∈V(vn)\{cm}() and
=(sign(),(floor(abs()))) where S is a function from the set of value that can take floor(abs())to the set As.

### Claim 2 (depends on 1)

The iterative decoder of claim 1 wherein ξ equal to 0 if dv=2, equal to 1 if dv>2 and dv is odd, and equal to 2 if dv>2 and dv is even.

### Claim 3 (depends on 1)

The iterative decoder of claim 1, wherein the constraints applied by the constraint nodes are parity check, convolution code or any block code.

### Claim 4 (depends on 3)

The iterative decoder of claim 3, wherein the codeword is coded by LDPC and the constraint nodes are check nodes.

### Claim 5 (depends on 1)

The iterative decoder of claim 1, wherein the function S is defined as S(x)=min(max(x−λ(x), 0),+Nq), where λ(x) is an integer offset value depending on the value of x.

### Claim 6 (depends on 5)

The iterative decoder of claim 5, wherein λ(x) is a random variable that can take it value in a predefined set of values according to a predefined law.

### Claim 7 (depends on 1)

The iterative decoder of claim 1, wherein alphabets As and Ac are identical.

### Claim 8 (depends on 1)

The iterative decoder of claim 1 wherein the means comprises
at least one processor; and
at least one memory including computer program code, the at least one memory and computer program code configured to, with the at least one processor, cause the performance of the decoder.

### Claim 9 (depends on 1)

An iterative decoding method for decoding a code composed of at least two constraint nodes and having a codeword length N, by an iterative decoder according to claim 1, said method comprising:
reception and storage (21) of the LLR In by the variable node vn, n=1 . . . N;
emission (23) of messages mvn→cm;
verification (25) of the constraints by the constraint nodes cm;
emission (27) of messages mcm−vn containing a possible candidate value for the variable n solving the constraints;
computation (29) by the variable nodes of
−ξ×sign (In)+Σc∈V(vn)\{cm} sign () where ξ is a positive or a null integer, and of messages to connected constraint nodes cm for iteration l+1 computed in two steps
=In+1/2×+Σc∈V(vn)\{cm}() and
=(sign(),(floor(abs()))) where S is a function from the set of value that can take floor (abs()) to the set As; and
iteration from emission of messages mvn→cm to their computation for the next iteration until the codeword is decoded or the number of iteration reaches a predetermined count.

### Claim 10 (depends on 9)

A computer readable medium encoding a machine-executable program of instructions to perform a method according to claim 9.
