Applications of adaptive belief propagation decoding for long Reed-Solomon codes

  • Authors:

  • Zhian Zheng;Dang Hai Pham;Tomohisa Wada

  • Affiliations:

  • Information Engineering Department, Graduate School of Engineering and Science, University of the Ryukyus, Okinawa, Japan;Faculty of Electronics and Telecommunications, Honoi Universtiy of Technology, Hanoi, Vietnam;Information Engineering Department, Graduate School of Engineering and Science, University of the Ryukyus, Okinawa, Japan

  • Venue:
  • AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reed-Solomon (204,188) code has been widely used in many digital multimedia broadcasting systems. This paper focuses on the low complexity derivation of adaptive belief propagation bit-level soft decision decoding for this code. Simulation results demonstrate that proposed normalized min-sum algorithm as belief propagation (BP) process provides the same decoding performance in terms of packet-error-rate as sum-product algorithm. An outer adaptation scheme by moving adaptation process of parity check matrix out of the BP iteration loop is also introduced to reduce decoding complexity. Simulation results show that the proposed two schemes perform a good trade-off between the decoding performance and decoding complexity.