An iterative LLR derivation algorithm based on extended min-sum decoding of non-binary LDPC codes

被引：0
作者：
He G.-H. [1 ,2 ]
Bai B.-M. [1 ,2 ]
Wang X.-P. [1 ]
机构：
[1] State Key Lab. of Integrated Service Networks, Xidian Univ.
[2] Science and Technology on Information Transmission and Dissemination in Communication Networks Lab.
来源：
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | 2011年 / 33卷 / 11期
关键词：
Decoder; Galois fields; Log Likelihood Ratio (LLR); Non-binary LDPC codes; Soft information;
D O I：
10.3724/SP.J.1146.2011.00322
中图分类号：
学科分类号：
摘要：
To overcome the drawback of the high complexity of Log Likelihood Ratio (LLR) generation and its accompanying sorting in Extended Min-Sum (EMS) decoding of non-binary Low-Density Parity-Check (LDPC) codes, for non-binary LDPC-coded BPSK modulation systems, a high-speed and low-complexity LLR derivation algorithm is proposed in this paper. The proposed algorithm employs an iterative computation method to generate and sort the LLRs. The front-end of a decoder implementing the proposed algorithm can work in pipeline mode, which accelerates the decoding process and increases the throughput of the decoder. Simulation results show that, the proposed algorithm incurs negligible performance loss, which makes it a good candidate for the hardware implementation of the front-end in non-binary LDPC decoders.
引用
收藏
页码：2622 / 2627
页数：5
相关论文
共 13 条
[1]  
Gallager R.G., Low-Density Parity-Check codes, IRE Transactions on Information Theory, 8, 1, pp. 21-28, (1962)
[2]  
Davey M.C., MacKay D.J.C., Low-density parity check codes over GF(q), IEEE Communications Letters, 2, 6, pp. 165-167, (1998)
[3]  
Hu X.Y., Eleftheriou E., Binary representation of cycle tanner-graph GF(2<sup>b</sup>) codes, IEEE International Conference on Communications, pp. 528-532, (2004)
[4]  
Hassani S., Hamon M., P'enard P., A comparison study of binary and non-binary LDPC codes decoding, The 19th International Conference on Software, Telecommunications and Computer Networks, pp. 355-359, (2010)
[5]  
Lin W., Bai B., Li Y., Et al., Design of q-ary irregular repeat-accumulate codes, International Conference on Advanced Information Networking and Applications, pp. 201-206, (2009)
[6]  
Zeng L., Lan L., Tai Y., Et al., Constructions of nonbinary quasi-cyclic LDPC codes: A finite field approach, IEEE Transactions on Communications, 56, 4, pp. 545-554, (2008)
[7]  
Zeng L., Lan L., Tai Y., Et al., Constructions of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach, IEEE Transactions on Communications, 56, 3, pp. 378-387, (2008)
[8]  
Mackay D.J.C., Davey M.C., Evaluation of gallager codes for short block length and high rate application, IMA International Conference on Mathematic and its Applications: Codes, Systems and Graphical Models, pp. 113-133, (2000)
[9]  
Declercq D., Fossorier M., Extended min-sum algorithms for decoding LDPC codes over GF(q), IEEE Transactions on Information Theory, 55, 4, pp. 633-643, (2007)
[10]  
Voicila A., Declercq D., Verdier F., Et al., Low-complexity decoding for non-binary LDPC codes in high order fields, IEEE Transactions on Communications, 58, 5, pp. 1355-1375, (2010)
12