Turbo decoding of product codes using adaptive belief propagation

Abstract : The adaptive belief propagation (ABP) algorithm was recently proposed by Jiang and Narayanan for the soft decoding of Reed-Solomon (RS) codes. In this paper, simplified versions of this algorithm are investigated for the turbo decoding of product codes. The complexity of the turbo-oriented adaptive belief propagation (TAB) algorithm is significantly reduced by moving the matrix adaptation step outside of the belief propagation iteration loop. A reduced-complexity version of the TAB algorithm that offers a trade-off between performance and complexity is also proposed. Simulation results for the turbo decoding of product codes show that belief propagation based on adaptive parity check matrices is a practical alternative to the currently very popular Chase-Pyndiah algorithm.
Document type :
Journal articles
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00573252
Contributor : Christophe Jego <>
Submitted on : Thursday, March 3, 2011 - 11:23:06 AM
Last modification on : Thursday, September 12, 2019 - 8:38:09 AM
Long-term archiving on : Saturday, June 4, 2011 - 2:45:08 AM

File

article_final_version.pdf
Files produced by the author(s)

Identifiers

Citation

Christophe Jego, Warren J. Gross. Turbo decoding of product codes using adaptive belief propagation. IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2009, 57 (10), pp.2864 -2867. ⟨10.1109/TCOMM.2009.10.070277⟩. ⟨hal-00573252⟩

Share

Metrics

Record views

202

Files downloads

294