Details

Autor(en) / Beteiligte

• Ben Thameur, Hayfa
• Khouja, Nadia
• Tlili, Fethi
• Le Gal, Bertrand
• Jego, Christophe

Titel

An LP-based algorithm for decoding terminated LDPC convolutional codes

Ist Teil von

• 2017 International Conference on Internet of Things, Embedded Systems and Communications (IINTEC), 2017, p.95-100

Ort / Verlag

IEEE

Erscheinungsjahr

2017

Quelle

IEEE Xplore

Beschreibungen/Notizen

• Linear programming (LP) technique was demonstrated as efficient for binary and non-binary LDPC block decoding. Indeed, it improves the error correction performance of codes and provides the Maximum-likelihood (ML) certificate. In this paper, the LP algorithm is applied for decoding LDPC convolutional codes (LDPC-CC). The proposed algorithm is built on the decomposition method based on the alternating direction method of multipliers (ADMM). Motivated by the strong convergence guarantees of an ADMM based LDPC block code (LDPC-BC) decoder and its comparable complexity to a Belief Propagation (BP) based LDPC-BC decoder, the efficiency of decoding LDPC-CCs using the ADMM algorithm is empirically analyzed in this paper. Simulations are carried over LDPC-CCs derived from LDPC-BCs and the LDPC-CC proposed by the IEEE 1901 standard. Experimental results show that the LP decoding approach is a promising technique for improving LDPC-CC error correction performance.