Fast parallel weighted bit flipping decoding algorithm for LDPC codes

Authors:
Miroslav Vanek;Peter Farkas
Affiliations:
Alcatel - Lucent, a.s., Bratislava, Slovakia;Dept. of Telecommunications, Slovak University of Technology, Bratislava, Slovakia
Venue:
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Year:
2009

Citing 3
Cited 1

Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Codes defined on graphs

IEEE Communications Magazine
Turbo decoding as an instance of Pearl's “belief propagation” algorithm

IEEE Journal on Selected Areas in Communications

Hybrid weighted bit flipping low density parity check decoding

Digital Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a fast version of the Parallel Weighted Bit Flipping LDPC decoding algorithm (PWBF) is presented. The idea, which allowed decreasing the computational complexity of the PWBF method, is based on the observation that in dependency on signal to noise ratio, many of the received bits in the codeword of LDPC code could be without error. The augmented algorithm makes tests based on syndromes and symbol involvement in parity checks, which are given by the factor graph corresponding to the chosen LDPC code in order to define so called guaranteed bits. These guaranteed bits do not participate in the decoding calculations further. Simulation results are presented, which show that there is not visible any significant performance deterioration by application of this method and that the approximate speed up of the decoding for the tested codes is about 25% on the selected hardware in comparison with the known PWBF.