Iterative decoder for decoding a code composed of at least two constraint nodes
AssigneeUniversite De Bretagne Sud
InventorsEmmanuel BOUTILLON, Franklin Rafael COCHACHIN HENOSTROZA
Life of this patent
Estimating the term…
Loading patent…
AssigneeUniversite De Bretagne Sud
InventorsEmmanuel BOUTILLON, Franklin Rafael COCHACHIN HENOSTROZA
Estimating the term…
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.
Iterative decoder configured for decoding a code composed of at least two constraint nodes and having a codeword length N, said decoder comprising:
Dependencies are inferred from the claim text.