OPTIMIZATION OF THE COMPUTATION OF PARITY CHECK MESSAGES IN A MIN-SUM LDPC DECODING METHOD

Abstract: the disclosure relates to an ldpc decoding method which involves performing iterations until a stop criterion is satisfied. each iteration involves computing variable messages (�), computing parity check messages (�), and computing a posteriori estimation variables. computing a parity check message (�) for a parity check node (cn) involves determining the two smallest values (min, min) among the absolute values of the variable messages associated with the parity check node (cn), comparing a difference between said values with a threshold, determining a correction value according to the result of the comparison, and computing the parity check message according to the correction value.

Inventor(s): Lyonel BARTHE, Benjamin GADAT

CPC Classification: H03M13/112 (CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means ; optical analogue/digital converters ; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. , , , , , , , , , , , ; ciphering or deciphering for cryptography or other purposes involving the need for secrecy ))

Search for rejections for patent application number 20250167806