IET Communications

Mixed modified weighted bit‐flipping decoding of low‐density parity‐check codes

Haiyi Huang, Yige Wang, Gang Wei

Published Dec 9, 2014• 11 citations

Abstract

In this study, a new weighted bit‐flipping (WBF) algorithm called mixed modified WBF (MM‐WBF) decoding is proposed for low‐density parity‐check codes. The new algorithm is built by mixing two WBF algorithms, one acting as the main decoding algorithm and the other acting as the auxiliary. Simulation results show that the new algorithm achieves a notable performance gain over reliability ratio‐based WBF, improved M‐WBF and low‐complexity WBF algorithms with almost the same computational complexity. Compared with some belief‐propagation‐based algorithms, MM‐WBF also provides an appealing performance against complexity trade‐off.

DOI: 10.1049/iet-com.2014.0192

Related papers

Combined modified weighted bit-flipping decoding of low-density parity-check codes

Haiyi Huang, Yige Wang, Gang Wei

In this paper, we propose a combined modified weighted bit-flipping (CM-WBF) algorithm for low-density parity-check (LDPC) codes. The new algorithm combines modified weighted bit-flipping (M-WBF) with low complexity weighted bit-flipping (LC-WBF). Simulation results show that the new algorithm offers a better trade-off among performance, complexity, and convergence compared with M-WBF, LC-WBF and RR-WBF algorithms for finite geometry LDPC (FG-LDPC) codes.

International Conference on Wireless Communications and Signal Processing (WCSP)Oct 1, 20121 citation

Cyclic switching weighted bit‐flipping decoding for low‐density parity‐check codes

Yige Wang, Guilong Wu

A cyclic switching weighted bit‐flipping (CS‐WBF) decoding algorithm for low‐density parity‐check (LDPC) codes is proposed in this study. By carefully choosing two selection criteria of the bit to flip and cyclically switching from one criterion to the other according to some rules during decoding, the proposed scheme can effectively break decoding loops, which often appear for weighted bit‐flipping (WBF) algorithms and greatly degrade decoding performance. Simulation results show that CS‐WBF provides 0.7–1.3 dB coding gain over various simple improved WBF algorithms, such as reliability ratio‐based WBF and improved modified WBF, with almost the same complexity for both regular and irregular LDPC codes. Compared with WBF algorithms that break decoding loops and the belief propagation‐based algorithm, CS‐WBF can also provide a better complexity‐performance trade‐off.

IET CommunicationsNov 17, 20174 citations

A Modification to Weighted Bit-Flipping Decoding Algorithm for LDPC Codes Based on Reliability Adjustment

D. Qian, M. Jiang, Chihang Zhao +1 more

In this paper, a modification to the weighted bit- flipping (WBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. This modification, based on the adjustment in reliabilities of the check sums during iterative decoding, can be applied to various WBF algorithms. Our studies show that the modification can be achieved with a small increase in complexity, but leads to an appealing improvement in error performance.

International Conference on CommunicationsJan 1, 20084 citations

Sum of the magnitude based weighted bit-flipping decoding algorithms for LDPC codes

Zhang Gao-yua

Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.

Systems engineering and electronicsJan 1, 20140 citations

Bootstrapped Modified Weighted Bit Flipping Decoding of Low Density Parity Check Codes

Yoichi Inaba

Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesApr 1, 20062 citations

Improved low-complexity low-density parity-check decoding

Zhiqiang Cui, Z. Wang

A practical low-complexity decoding of low-density parity-check codes is studied. A fast decoding scheme for weighted bit-flipping (WBF) based algorithms is first proposed. Then, an optimised 2 bit decoding scheme and its VLSI architecture are presented. It is shown that the new approach has significantly better decoding performance while having comparable hardware complexity compared with WBF-based algorithms.

IET CommunicationsAug 22, 20089 citations