Joint decoding algorithm of LDPC codes

被引：0
|
作者：
Fang Y. [1 ]
Zhang J.-W. [1 ]
Wang L. [1 ]
机构：
[1] Department of Communication Engineering, Xiamen University
来源：
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2011年 / 33卷 / 06期
关键词：
Belief propagation-Maxwell (BM) decoder; Frame error rate (FER); Low-density parity-check (LDPC) code; Small-scale error;
D O I：
10.3969/j.issn.1001-506X.2011.06.37
中图分类号：
学科分类号：
摘要：
Designing a realizable maximum likelihood (ML) decoder for low-density parity-check (LDPC) codes is always a challenging work over an additive white Gaussian noise (AWGN) channel. Although Maxwell decoder is well known for its excellent performance over the binary erasure channel (BEC), it seems that generalizing this algorithm for other channels is difficult. This paper introduces an idea called channel transformation which could realize the conversation between two different channels. A Maxwell decoder is applied to an AWGN channel. In terms of this method, and a joint decoder-BP-Maxwell (BM) decoder is proposed which combines a belief propagation (BP) decoder and a Maxwell decoder, to reduce the gap to the ML decoder in performance. Simulation results show that the BM decoding algorithm could break most small trapping sets to accomplish a lower frame error rate (FER). Moreover it also could eliminate most of the small-scale errors compared with a BP decoder.
引用
收藏
页码：1387 / 1391
页数：4
相关论文
共 17 条
  • [1] Gallager R.G., Low-Density Parity-Check Codes, (1963)
  • [2] Landner S., Hehn T., Milenkovic O., Et al., Two methods for reducing the error-floor of LDPC codes
  • [3] Yazdani M.R., Hemati S., Banihashemi A.H., Improving belief propagation on graphs with cycles, IEEE Communication Letters, 8, 1, pp. 57-59, (2004)
  • [4] Taghavi N.M.H., Siegel P.H., Adaptive methods for linear programming decoding, IEEE Trans. on Information Theory, 54, 12, pp. 5396-5410, (2008)
  • [5] Han Y., Ryan W.E., Low-floor decoders for LDPC codes, IEEE Trans. on Communications, 57, 6, pp. 1663-1673, (2009)
  • [6] Kang J.Y., Zhang L., Ding Z., Et al., A two-stage iterative decoding of LDPC codes for lowering error floors, Proc. of the Global Telecommunication Conference, pp. 1-4, (2008)
  • [7] Varnica N., Fossorier M.P.C., Kavcic A., Augmented belief propagation decoding of low-density parity-check codes, IEEE Trans. on Communications, 55, 7, pp. 1308-1317, (2007)
  • [8] Zhang Z.Y., Dolecek L., Nikolic B., Et al., Lowering LDPC error floors by postprocessing, Proc. of the Global Telecommunication Conference, pp. 1-6, (2008)
  • [9] Pishro N.H., Fekri F., Results on punctured low-density parity-check codes and improved iterative decoding techniques, IEEE Trans. on Information Theory, 53, 2, pp. 599-614, (2007)
  • [10] Luby M., Mitzenmacher M., Shokrollahi M., Et al., Efficient erasure correcting codes, IEEE Trans. on Information Theory, 47, 2, pp. 569-584, (2001)
12