Title
Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes
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.
Year
DOI
Venue
2010
10.1109/TCOMM.2010.091310.090327
IEEE Transactions on Communications
Keywords
Field
DocType
finite geometries,error performance,non-binary finite field,decoding complexity,integer operation,finite field,decoding algorithm,non-binary sum product algorithm,non-binary ldpc code,decoding ldpc code,effective trade-off,algorithms,ldpc,reliability,finite fields,fast fourier transform,message passing,geometry,ldpc code,decoding
Concatenated error correction code,Berlekamp–Welch algorithm,Sequential decoding,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Algorithm,Error detection and correction,Decoding methods,List decoding
Journal
Volume
Issue
ISSN
58
11
0090-6778
Citations 
PageRank 
References 
34
1.63
17
Authors
4
Name
Order
Citations
PageRank
Chao-Yu Chen112414.15
Qin Huang235534.55
Chi-chao Chao322724.40
Shu Lin498572.16