Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes

  • Authors:
  • Chao-Yu Chen;Qin Huang;Chi-chao Chao;Shu Lin

  • Affiliations:
  • Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.;Department of Electrical and Computer Engineering, University of California, Davis, CA;Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.;Department of Electrical and Computer Engineering, University of California, Davis, CA

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.