Decoding of non-binary low-density parity-check codes based on the genetic algorithm and applications over mobile fading channels

• Published in: IET communications Vol. 9; no. 16; pp. 1941 - 1948
• Main Authors: Liu, Xingcheng, Liang, Chulong, Zhang, Yuanbin, Zhang, Lin
• Format: Journal Article
• Language: English
• Published: The Institution of Engineering and Technology 05.11.2015
• Subjects: additive white Gaussian noise channels; Algorithms; AWGN channels; belief‐propagation decoding algorithm; binary codes; binary LDPC codes; channel coding; Channels; Decoding; Error correcting codes; Fading; fading channels; genetic algorithm; Genetic algorithms; graph theory; low bit‐error‐rate region; Mathematical models; message propagation; Messages; mobile computing; mobile fading channels; nonbinary low‐density parity‐check codes; parity check codes; Tanner graph; variable node determination; binary codes; variable node determination; channel coding; graph theory; parity check codes; message propagation; Tanner graph; genetic algorithms; nonbinary low-density parity-check codes; decoding; AWGN channels; genetic algorithm; mobile fading channels; mobile computing; fading channels; belief-propagation decoding algorithm; low bit-error-rate region; additive white Gaussian noise channels; binary LDPC codes
• ISSN: 1751-8628; 1751-8636
• DOI: 10.1049/iet-com.2015.0085

In this study, an efficient decoding algorithm is proposed to decode non-binary low-density parity-check (LDPC) codes. The algorithm is derived from the belief-propagation (BP) decoding with genetic algorithm of binary LDPC codes. For the proposed algorithm, two decoding constraints are introduced to determine variable nodes which are considered highly reliable. The messages from these highly reliable variable nodes are then magnified with an appropriate parameter γ. This process can make the messages propagate in the Tanner graph more efficiently. Simulation results show that, compared with the fast Fourier transform-based BP algorithm, the proposed algorithm can have an equal or better performance in low bit-error-rate region over both the additive white Gaussian noise channels and the mobile fading channels.