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

Physical Communication

Generalized weighted bit-flipping LDPC decoding for asymmetric optical channels

Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian

Published May 11, 2021• 7 citations
Publisher
DOI
10.1016/j.phycom.2021.101369

Related papers

Hybrid weighted symbol-flipping decoding for nonbinary LDPC codes

刘冰, Tao -, Wei Wei +4 more

高技术通讯:英文版•Jan 1, 2013•2 citations

The Weighted Information Storage Bit-Flipping Decoder for Generalized LDPC Codes

Haobin Xu, Zhongfeng Wang, Suwen Song

By incorporating stronger component codes, generalized Low-Density-Parity-Check (GLDPC) codes significantly enhance error-correction capability. Bit-flipping (BF) algorithms are among the primary hard-decision decoding algorithms for GLDPC codes. However, existing BF algorithms for GLDPC still exhibit limited decoding performance. This paper proposes a Weighted Information Storage Bit-Flipping (WISBF) decoding algorithm for GLDPC codes with different types of component codes to improve the decoding performance, which introduces a two-stage energy-update strategy to reduce the percentage of erroneous flips and lower the average number of iterations. The simulation results demonstrate that the WISBF algorithm far outperforms the state-of-the-art Weighted Bit-Flip Voting (WBFV) on the tested GLDPC code, achieving an approximately three-order-of-magnitude improvement in frame-errorrate (FER). Moreover, the GLDPC codes with WISBF also achieve superior performance over their LDPC counterparts decoded using existing bit-flipping (BF) algorithms, including the Information Storage Bit-Flipping (ISBF) algorithm. We then present a detailed hardware architecture for the WISBF decoder. Synthesized under the TSMC $90-\mathrm{nm}$ technology, the proposed GLDPC WISBF decoder achieves $\mathbf{1 1 4. 3 \%}$ higher throughput than the GLDPC WBFV decoder.

IEEE International Conference on Electronics, Communications and Intelligent Science (ECIS)•May 22, 2026•0 citations

Weighted symbol-flipping decoding algorithm for nonbinary LDPC codes with flipping patterns

Bing Liu, Jun Gao, Wei Tao +1 more

Journal of Systems Engineering and Electronics•Oct 1, 2011•7 citations

Reliability Ratio Based Weighted Bit-Flipping Decoding for LDPC codes

Feng Guo, L. Hanzo

In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.

IEEE Vehicular Technology Conference•Dec 10, 2005•15 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 electronics•Jan 1, 2014•0 citations

Architecture of Generalized Bit-Flipping Decoding for High-Rate Non-binary LDPC Codes

Francisco García-Herrero, María José Canet, Javier Valls

Circuits Systems and Signal Processing•Aug 30, 2012•7 citations
By incorporating stronger component codes, generalized Low-Density-Parity-Check (GLDPC) codes significantly enhance error-correction capability. Bit-flipping (BF) algorithms are among the primary hard-decision decoding algorithms for GLDPC codes. However, existing BF algorithms for GLDPC still exhibit limited decoding performance. This paper proposes a Weighted Information Storage Bit-Flipping (WISBF) decoding algorithm for GLDPC codes with different types of component codes to improve the decoding performance, which introduces a two-stage energy-update strategy to reduce the percentage of erroneous flips and lower the average number of iterations. The simulation results demonstrate that the WISBF algorithm far outperforms the state-of-the-art Weighted Bit-Flip Voting (WBFV) on the tested GLDPC code, achieving an approximately three-order-of-magnitude improvement in frame-errorrate (FER). Moreover, the GLDPC codes with WISBF also achieve superior performance over their LDPC counterparts decoded using existing bit-flipping (BF) algorithms, including the Information Storage Bit-Flipping (ISBF) algorithm. We then present a detailed hardware architecture for the WISBF decoder. Synthesized under the TSMC 90−nm90-\mathrm{nm}90−nm technology, the proposed GLDPC WISBF decoder achieves 114.3%\mathbf{1 1 4. 3 \%}114.3% higher throughput than the GLDPC WBFV decoder.
In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.
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.