Greedy Belief Propagation Algorithm for Low-Complexity LDPC Decoding
摘要
In this paper, we propose a greedy belief propagation (BP) algorithm in LDPC (Low Density Parity Check) decoding for reducing processing complexity at mobile terminals. In this algorithm, we implement the greedy algorithm in BP decoding for the optimization procedure. Its performance is evaluated and compared with the conventional BP algorithm in terms of mean bit error rate and average time per iteration. Our simulation results show that its performance is close to that of the conventional BP algorithm while its complexity is lower. The greedy BP algorithm can be used for cost and power consumption reduction at mobile terminals, which would be helpful for mobile IoT (Internet of Things) networks.