版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China
出 版 物:《IET COMMUNICATIONS》 (IET Commun.)
年 卷 期:2015年第9卷第16期
页 面:1941-1948页
核心收录:
基 金:National Natural Science Foundation of China [61173018 61401164]
主 题:fading channels mobile computing binary codes parity check codes channel coding decoding genetic algorithms AWGN channels graph theory nonbinary low-density parity-check codes genetic algorithm mobile fading channels belief-propagation decoding algorithm binary LDPC codes variable node determination message propagation Tanner graph low bit-error-rate region additive white Gaussian noise channels
摘 要: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.