Adaptive scaling of parity check messages for LDPC decoding
AssigneeAirbus Defence and Space GmbH
InventorsLyonel Barthe, Benjamin Gadat
Life of this patent
Estimating the term…
Loading patent…
AssigneeAirbus Defence and Space GmbH
InventorsLyonel Barthe, Benjamin Gadat
Estimating the term…
The disclosure relates to an LDPC decoding method which involves performing iterations until a stop criterion is satisfied. Each iteration involves calculating variable messages (αn,m), calculating parity check messages (βm,n), and calculating a posteriori estimation variables. The parity check messages (βm,n) and the posteriori estimation variables (γn) being saturated at a predetermined maximum value. At the end of an iteration, when the number of saturations reaches a specified threshold, the method involves at least a first scaling of the parity check messages (βm,n) and the a posteriori estimation variables (γn). Scaling corresponds to assigning, to a value, an integer which has the same sign and whose absolute value is the nearest integer greater than the absolute value of the value divided by two.
A method for decoding a codeword with a decoder of low-density parity check code (LDPC) code, said LDPC code being defined by a binary parity matrix of size M×N stored in a memory of the decoder, M and N being positive integers, the parity matrix corresponding to a representation of a bipartite graph comprising connections between M parity check nodes and N variable nodes, each line of the parity matrix corresponding to a parity equation associated with a parity check node, each column of the parity matrix corresponding to a variable associated with a variable node, each non-zero element of the parity matrix corresponding to a connection between a parity check node and a variable node, the codeword to be decoded corresponding to a set of values taken respectively by said variables, the method comprising executing one or more iterations by a processing unit until a stop criterion is met, each iteration comprising:
A decoder of low-density parity check code (LDPC) code, said LDPC code being defined by a binary parity matrix of size M×N stored in a memory of the decoder, M and N being positive integers, the parity matrix corresponding to a representation of a bipartite graph comprising connections between M parity check nodes and N variable nodes, each line of the parity matrix corresponding to a parity equation associated with a parity check node, each column of the parity matrix corresponding to a variable associated with a variable node, each non-zero element of the parity matrix corresponding to a connection between a parity check node and a variable node, a codeword to be decoded corresponding to a set of values taken respectively by said variables, the decoder including a processing unit configured to execute one or more iterations until a stop criterion is met, to:
Dependencies are inferred from the claim text.