pith. sign in

arxiv: 1206.3362 · v1 · pith:IKH5NRPGnew · submitted 2012-06-15 · 💻 cs.IT · math.IT

An Improved WBF Algorithm for Higher-Speed Decoding of LDPC Codes

classification 💻 cs.IT math.IT
keywords algorithmdecodingldpcstrategydecoderdelayflippingfwbf
0
0 comments X
read the original abstract

Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF) algorithm. Specifically, based on the stochastic error bitmap of the received vector, a partially parallel bit-choose strategy is adopted to lower the delay of choosing the bit flipped. Because of its partially parallel structure, the novel strategy can be well incorporated into the LDPC decoder [1]. The analysis of the decoding delay demonstrates that, the decoding speed can be greatly improved by adopting the proposed FWBF algorithm. Further, simulation results verify the validity of the proposed algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.