Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Xidian University

Low complexity decoding algorithm for LDPC codes and design of key circuits

MA Ke-xian

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

Parallel Weighted Bit Flipping(PWBF)can achieve a good decoding performance.However,it is hard for the hardware design and implementation because of the high complexity of its bit-chosen mechanism.By improving the bit-chosen mechanism in PWBF,a low-complexity decoding algorithm is proposed in this paper.Especially,in each iteration step of decoding,after the metric value of every bit is updated,several bits with the largest metric values are flipped.Furthermore,the optimized circuits with low complexity are provided for the critical modules of the proposed algorithm.Compared with the PWBF algorithm,the complexity of LDPC decoders is greatly decreased by use of the proposed algorithm and the optimized circuits.

Related papers

Parallel Weighted Bit-Flipping Decoding

Xiaofu Wu, Chunming Zhao, Xiaohu You

A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding.

IEEE Communications Letters•Aug 1, 2007•53 citations

Fast Parallel Weighted Bit Flipping decoding algorithm for LDPC codes

M. Vanek, Peter Farkaš

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.

Wireless Telecommunications Symposium•May 1, 2009•2 citations

An Improved Weighted Bit-Flipping Algorithm for High-Speed LDPC Decoding

MA Ke-xian

In order to improve the decoding speed of low density parity check code( LDPC) codes,a fast weighted bit flipping algorithm with partially parallel bit-chosen is proposed. In this scheme,all bits are firstly divided into several blocks according to the stochastic error distribution in the received vector. And then one bit is chosen from each block to form the candidate set of flipped bits. Finally,a proper number of bits are chosen from the candidate set and flipped to implement the decoding. Furthermore,the tree sorting and data pool methods are adopted to decrease the computational complexity of the key module of the proposed algorithm. Compared with the multi-bit flippin( MBF) algorithm by simulations,the proposed scheme and the method of hardware implement can achieve significant improvement in the decoding speed.

Beijing Youdian Xueyuan xuebao•Jan 1, 2014•0 citations

An Efficient Weighted Bit-Flipping Algorithm for Decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability

Tso-Cho Chen, Erl‐Huei Lu, Chia-Jung LI +1 more

In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.

IEICE Transactions on Communications•Jan 1, 2017•1 citation

Improved parallel weighted bit-flipping decoding algorithm for LDPC codes

Guanchang Li, G. Feng

Aiming at seeking a low-complexity decoder with fast decoding convergence speed for short or medium low-density parity-check (LDPC) codes, an improved parallel weighted bit-flipping (IPWBF) algorithm, which is applied flexibly for two classes of codes is presented here. For LDPC codes with low column weight in their parity check matrix, both bootstrapping and loop detection procedures, described in the existing literature, are included in IPWBF. Furthermore, a novel delay-handling procedure is introduced to prevent the codeword bits of high reliability from being flipped too hastily. For large column weight finite geometry LDPC codes, only the delay-handling procedure is included in IPWBF to show its effectiveness. Extensive simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.

IET Communications•Jan 7, 2009•13 citations

Two-staged Weighted Bit Flipping (WBF) decoding algorithm for LDPC codes

Kexiang Ma, Jing Jin, Wei Li +1 more

In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorithms are adopted separately. Correspondingly, by the study of the iterative decoding process of the PWBF algorithm, a simple function is introduced to dynamically implement the switch of two decoding stages. The proposed algorithm can noticeably lower the error floor of PWBF algorithm with a modest increase in computation complexity and hardware cost. The validation of the proposed algorithm is verified by simulation.

IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)•Sep 1, 2015•4 citations
Parallel Weighted Bit Flipping(PWBF)can achieve a good decoding performance.However,it is hard for the hardware design and implementation because of the high complexity of its bit-chosen mechanism.By improving the bit-chosen mechanism in PWBF,a low-complexity decoding algorithm is proposed in this paper.Especially,in each iteration step of decoding,after the metric value of every bit is updated,several bits with the largest metric values are flipped.Furthermore,the optimized circuits with low complexity are provided for the critical modules of the proposed algorithm.Compared with the PWBF algorithm,the complexity of LDPC decoders is greatly decreased by use of the proposed algorithm and the optimized circuits.
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.
In order to improve the decoding speed of low density parity check code( LDPC) codes,a fast weighted bit flipping algorithm with partially parallel bit-chosen is proposed. In this scheme,all bits are firstly divided into several blocks according to the stochastic error distribution in the received vector. And then one bit is chosen from each block to form the candidate set of flipped bits. Finally,a proper number of bits are chosen from the candidate set and flipped to implement the decoding. Furthermore,the tree sorting and data pool methods are adopted to decrease the computational complexity of the key module of the proposed algorithm. Compared with the multi-bit flippin( MBF) algorithm by simulations,the proposed scheme and the method of hardware implement can achieve significant improvement in the decoding speed.
In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.
Aiming at seeking a low-complexity decoder with fast decoding convergence speed for short or medium low-density parity-check (LDPC) codes, an improved parallel weighted bit-flipping (IPWBF) algorithm, which is applied flexibly for two classes of codes is presented here. For LDPC codes with low column weight in their parity check matrix, both bootstrapping and loop detection procedures, described in the existing literature, are included in IPWBF. Furthermore, a novel delay-handling procedure is introduced to prevent the codeword bits of high reliability from being flipped too hastily. For large column weight finite geometry LDPC codes, only the delay-handling procedure is included in IPWBF to show its effectiveness. Extensive simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.
In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorithms are adopted separately. Correspondingly, by the study of the iterative decoding process of the PWBF algorithm, a simple function is introduced to dynamically implement the switch of two decoding stages. The proposed algorithm can noticeably lower the error floor of PWBF algorithm with a modest increase in computation complexity and hardware cost. The validation of the proposed algorithm is verified by simulation.