An investigation in iterative decoding of Reed-Solomon codes based on adaptive belief propagation

Author

Yang, Yushan ; Jiang, Ming ; Wu, Xiaofu

Author_Institution

Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China

fYear

2009

fDate

13-15 Nov. 2009

Firstpage

1

Lastpage

5

Abstract

In this paper, a practical approach to the iterative soft-decision decoding algorithms based on adaptive belief propagation (ABP) is investigated for Reed-Solomon (RS) codes. The novelty is cascading a simplified chase type decoder to the ABP scheme in each iteration, which can be viewed as an efficient termination criterion deployed in the ABP algorithm. Simulation results show that the proposed algorithm improves the FER performance and converges with fewer iterations averagely, which declares a significant complexity reduction.

Keywords

Reed-Solomon codes; belief networks; iterative decoding; Reed-Solomon codes; adaptive belief propagation; complexity reduction; iterative decoding; simplified chase type decoder; soft-decision decoding; Belief propagation; Computational modeling; Hardware; Iterative algorithms; Iterative decoding; Iterative methods; Laboratories; Mobile communication; Parity check codes; Reed-Solomon codes; Chase type decoder; Reed-Solomon (RS) codes; adaptive belief propagation (ABP); iterative decoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on

Conference_Location

Nanjing

Print_ISBN

978-1-4244-4856-2

Electronic_ISBN

978-1-4244-5668-0

Type

conf

DOI

10.1109/WCSP.2009.5371418

Filename

5371418