International ICST Conference on Communications and Networking in China

Iterative symbol-by-symbol decoding of LDPC codes and constellation mapping for multilevel modulation

Hongtao Jiang, Zhongfeng Wang, Huaping Liu

Published Jan 1, 2010• 0 citations

Abstract

Iterative probabilistic decoding of binary low-density parity-check (LDPC) codes have been studied extensively. Non-binary LDPC codes have recently attracted an increasing attention. Most of the existing non-binary codes are built over GF(2^q), and decoding methods developed for binary LDPC codes ca

DOI: 10.4108/chinacom.2010.7

Related papers

Iterative Decoding of Low-Density Parity Check Codes (A Survey)

Venkatesan Guruswami

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely efficient (both in theory and practice).

arXiv:cs/0610022Oct 5, 200611 citations

Parallel Symbol-Flipping Decoding for Non-Binary LDPC Codes

Chao-Cheng Huang, Chi‐Jen Wu, Chao‐Yu Chen +1 more

A new low-complexity parallel symbol-flipping decoding algorithm for non-binary low-density parity-check (NB-LDPC) codes is proposed. The algorithm outperforms quite a number of existing reliability-based message-passing algorithms, and its computation complexity is smaller than that of almost all the previously proposed iterative decoding algorithms for NB-LDPC codes. It is suitable for decoding NB-LDPC codes whose parity-check matrices have large column weights.

IEEE Communications LettersJun 1, 201323 citations

Efficient symbol reliability based decoding for QCNB-LDPC codes

Leixin Zhou, Jin Sha, Yun Chen +2 more

As an extension of binary low-density parity-check (LDPC) codes, non-binary LDPC (NB-LDPC) codes show significantly better performance when the code length is moderate or small. Recently, enhanced iterative hard reliability based (EIHRB) decoding algorithm is proposed to reduce the computation complexity. However, the EIHRB algorithm suffers a lot from significant performance degradation when the column weight is small. In this paper, a symbol reliability based (SRB) decoding algorithm, which also performs well when the column weight is low, is proposed for NB-LDPC decoding to improve the decoding performance. With the same maximum iteration number, around 0.38 dB extra coding gain is achieved. Furthermore, the corresponding efficient decoder architecture is proposed. Comparison results have shown that the proposed SRB algorithm can not only achieve good coding gain, but the cost for hardware implementation is reasonable.

IEEE International Symposium on Circuits and Systems proceedingsJun 1, 20142 citations

Iterative Decoding of Low-Density Parity Check Codes

Venkatesan Guruswami

Bulletin of the European Association for Theoretical Computer ScienceJan 1, 200611 citations

Iterative Decoding with Bias Terms for LDPC Codes

Hiroshi Kamabe, Shusaku Kobota

IEICE Technical Report; IEICE Tech. Rep.Dec 31, 20090 citations

Fast and Reduced-Complexity Decoding Rule for qary LDPC Codes by Using the Duality Properties

Alaa Ghaith, Joseph J. Boutros, Yi Yuan-Wu

The paper studies symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for non binary codes over an extension field GF(q). This decoding rule minimizes the probability of symbol error over a time-discrete memory less channel by employing the dual code. It is shown that these algorithms meet all requirements needed for iterative decoding as the output of the decoder can be split into three independent estimates: soft channel value, a priori term and extrinsic value. It represents a better form of coding for the q-ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed-Solomon codes on the AWGN channel and it gives us a new fast and reduced-complexity decoding algorithm. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Finally, we see that complexity is reduced by using the dual code, and the algorithm is accelerated by using the fast Hadamard transform (FHT). Examples are given for both single parity check (non iterative case) and LDPC (iterative case) non binary codes

IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)Sep 22, 20062 citations