Journal of Sichuan University

The simplified difference-domain LDPC decoding algorithm based on RMP-scheduling

Lei Hai

Published Jan 1, 2012• 1 citation

Abstract

As for the problems of the high complexity of Log-Domain sum-product LDPC decoding algorithm and the slow convergence rate based on SMP scheduling,this paper propose the simplified difference -domain LDPC decoding algorithm based on RMP scheduling.The update of variable-nodes are optimized by RMP scheduling,which can accelerate the convergence rate one time.Due to that the messages pass on the Tanner graph are probability differences and the update of check-nodes are carried out by w minimum absolute values,which can further reduce the complexity of computation.In contrast with decoding algorithm by experiment show that the proposed algorithm can reduce the complexity of computation and accelerate the convergence rate,while it has no obvious loss of decoding performance.

Related papers

Efficient decoding implementations of LDPC codes

Wenbo Wang

As for the sum-product decoding algorithm of LDPC codes,a new kind of difference-based decoding method is proposed.The main idea about it is that the messages passed on the bipartite graph of LDPC are based on the probability differences,and the renewal of both check nodes and message nodes is carried out on the special addition domain.As for the renewal of check nodes,some differences possessing the minimum absolute values can be selected to further reduce the complexity of computation.In contrast with the traditional LLR-based decoding method,the proposed method has much lower complexity,while it has no obvious loss of performance and convergence.

Systems engineering and electronicsJan 1, 20100 citations

Novel Efficient Decoding Implementation of LDPC Codes

Wenbo Wang

As for the sum-product decoding algorithm of low density parity check(LDPC) codes,a difference-based decoding method is proposed.The main idea is shown as follows: the messages passed on the bipartite graph of LDPC are based on the probability differences,and the updates of both check nodes and message nodes are carried out on some special addition domain.As for the update of check nodes,only some lowest differences can be selected for reducing computational complexity.In contrast with the traditional log-likelyhood-ratio-based(LLR-based) decoding method,the proposed method has much lower complexity,while it has no obvious loss of performance and convergence.

Beijing Youdian Xueyuan xuebaoJan 1, 20071 citation

Analysis of LDPC Decoding Algorithm Based on Serial Schedule

Lei Jing, Caac Scientific

LDPC and sum product decoding algorithm based on flooding schedule which invented by Gallager are briefly introduced.On this condition,present a serial schedule for LDPC decoding.Such serial decoding algorithm processes and passes messages according to some order of check nodes or variable nodes,assuring the updated messages could join iterative process immediately,therefore improve convergence property,and utilize the relationship between messages,improve message passing process,it can reduce required memory.Analyses the complexity of both algorithms,verifies the serial algorithm which based on check nodes could reduces decoding complexity greatly,and simulates over AWGN channel.Results of simulation show that the decoding performance could be improved by serial algorithm.

Journal of Sichuan UniversityJan 1, 20061 citation

LDPC BP-based decoding algorithm combined with group shuffle schedule

Yong Xiao

The belief propagation(BP-based)decoding algorithm can reduce the computational complexity by simplifying the information update in the check nodes and introducing the correlation among the transmitting information.In order to decrease the performance loss and the iteration numbers of the simplified BP-based decoding algorithm,the improved decoding algorithm combined the simplified BP-based decoding algorithm with group shuffle schedule was presented in this paper.The information update in the check nodes was speeded up and the information error probability from the stop set to the nodes in Tanner graph was significantly lowered in such improved algorithm.The MATLAB simulation results show that the improved algorithm can effectively enhance the decoding performance.

Journal of Chongqing University of Posts and TelecommunicationsJan 1, 20100 citations

Efficient Difference-based Decoding Implementations of LDPC Codes

Zhanji Wu, Peng Mugen, Wang Wenbo +1 more

Efficient implementations of the sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes using difference-based messages between bit nodes and check nodes are presented. As for the updates of check nodes, reduced- complexity derivatives are also put forward. As compared with the traditional Log-Likelihood-Ratio(LLR)-based decoding implementations, the proposed method has much lower complexity and latency, while it has no obvious loss of the error performance.

IEEE Communications LettersMay 1, 20083 citations

Differential Decoding of Low-Density Parity-Check Codes Based on Min Sum Algorithm

Shizhang Peng, Zemao Zhao, Jianrong Bao

To improve performance and reduce computation complexity of the low-density parity-check (LDPC) codes, a min-sum based differential decoding algorithm is proposed. The main principle is that the messages passing in the bipartite graph of the codes are the probability differences and the updates of the check nodes adopt min sum algorithm. Simulation results show that the proposed algorithm can achieve about 0.4dB performance gain over the UMP BP-Based decoding algorithm at bit error rate (BER) of under an additive white Gaussian noise (AWGN) channel. And it can obtain good performance very close to that of the BP decoding algorithm with much lower complexity.

International Symposium on Information Science and EngineeringDec 1, 20102 citations