Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix

DOI10.1109/TIT.2006.878176MaRDI QIDQ3548131zbMATH OpenOpenAlexFDO

Authors Jing Jiang, Krishna R. Narayanan

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0506073

Mathematics Subject Classification ID

Decoding (94B35)

Abstract: An iterative algorithm is presented for soft-input-soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum product algorithm (SPA) in conjunction with a binary parity check matrix of the RS code. The novelty is in reducing a submatrix of the binary parity check matrix that corresponds to less reliable bits to a sparse nature before the SPA is applied at each iteration. The proposed algorithm can be geometrically interpreted as a two-stage gradient descent with an adaptive potential function. This adaptive procedure is crucial to the convergence behavior of the gradient descent algorithm and, therefore, significantly improves the performance. Simulation results show that the proposed decoding algorithm and its variations provide significant gain over hard decision decoding (HDD) and compare favorably with other popular soft decision decoding methods.

Recommendations

• Soft-In Soft-Out Decoding of Reed–Solomon Codes Based on Vardy and Be'ery's Decomposition
• An efficient soft-decision Reed-Solomon decoding algorithm
• Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information
• Algebraic soft-decision decoding of reed-solomon codes
• Bit-level soft-decision decoding of Reed-Solomon codes

Cited in

(7)

• Blind recognition of binary BCH codes for cognitive radios
• scientific article; zbMATH DE number 2127883 (Why is no real title available?)
• Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
• Soft-In Soft-Out Decoding of Reed–Solomon Codes Based on Vardy and Be'ery's Decomposition
• An efficient soft-decision Reed-Solomon decoding algorithm
• Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
• Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations

This page was built for publication: Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548131)