Bootstrapped Iterative Decoding Algorithms for Low Density Parity Check (LDPC) Codes (original) (raw)
Related papers
A New Reliability Ratio Weighted Bit Flipping Algorithm for Decoding LDPC Codes
Wirel. Commun. Mob. Comput., 2021
In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low-Density Parity-Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.
Reliability ratio based weighted bit-flipping decoding for low-density parity-check codes
Electronics Letters, 2004
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 [1] and the improved weighted bit-flipping (IWBF) algorithm [2]. More than 1 and 2 dB coding gain was achieved at an BER of 10 −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.
IJERT-BER Performance Comparison of Bit Flipping Algorithms used for Decoding of LDPC Codes
International Journal of Engineering Research and Technology (IJERT), 2015
https://www.ijert.org/ber-performance-comparison-of-bit-flipping-algorithms-used-for-decoding-of-ldpc-codes https://www.ijert.org/research/ber-performance-comparison-of-bit-flipping-algorithms-used-for-decoding-of-ldpc-codes-IJERTV4IS051311.pdf In this paper the Bit Error Rate (BER) performance of different bit flipping algorithms used for decoding of Low Density Parity Check (LDPC) code is compared. These algorithms mainly depend on inversion function. Through simulation results the Noisy Gradient Descent Bit flipping (NGDBF) algorithm is proved to be best till date. This algorithm provides the best BER performance, for Smoothed Noisy Gradient Descent Bit flipping (SM-NGDBF) algorithm we can obtain BER 4.86×10-4 at 3.5db. The Multi Noisy Gradient Descent Bit flipping (M-NGDBF) algorithm requires the least number of iterations than the other algorithms proposed for decoding a codeword.
Reliability-based schedule for bit-flipping decoding of low-density Parity-check codes
IEEE Transactions on Communications, 2004
A reliability-based message-passing schedule for iterative decoding of low-density parity-check codes is proposed. Simulation results for bit-flipping algorithms (with binary messages) show that a reliability-based schedule can provide considerable improvement in performance and decoding speed over the so-called flooding (parallel) schedule, as well as the existing graph-based schedules. The cost associated with this improvement is negligible and is equivalent to having a two-bit representation for initial messages, instead of the standard one bit for hard-decision algorithms, only at the first iteration (all the exchanged messages are still binary).
Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory, 2005
In this correspondence, a new method for improving hard-decision bit-flipping decoding of low-density parity-check (LDPC) codes is presented. Bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability 1 which is independent of the code considered. The probability is incremented during decoding according to some rule. With a proper choice of the initial , the proposed improved bit-flipping (BF) algorithm achieves gain not only in performance, but also in average decoding time for signal-to-noise ratio (SNR) values of interest with respect to = 1.
Two bit-flipping decoding algorithms for low-density parity-check codes
IEEE Transactions on Communications, 2009
In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density paritycheck (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.
IJERT-Bit Flipping Decoders for LDPC Codes: A Short Survey
International Journal of Engineering Research and Technology (IJERT), 2020
https://www.ijert.org/bit-flipping-decoders-for-ldpc-codes-a-short-survey https://www.ijert.org/research/bit-flipping-decoders-for-ldpc-codes-a-short-survey-IJERTV9IS110120.pdf In the domain of wireless communication systems, Error Control Coding schemes are one of the widely relied upon or responsible methodology for securing the integrity and authenticity of the data transmission process. In the last decade, due to the advent of modern communication standards and their wide range of services, there has been a resurgence of interest and support in the research community towards the conception of efficient and versatile error control coding techniques. Recent developments in the wireless communication-based technologies have witnessed the pliable nature of low-density parity-check (LDPC) codes and their contributions which cannot be overstated. As of now, the decoding schemes based on LDPC codes have emerged as one of the most promising and efective coding scheme for addressing several key problems of reliable data communication. In this article, comprehensive overview on the on some well-known LDPC hard decision decoding algorithms is provided. In addition, simulations carried out on various LDPC decoding algorithms based on their performance is also presented. Finally, at the end of this review, the scope for future prospects are forecasted through discussions.
International Journal of Electrical and Computer Engineering (IJECE), 2021
For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high-speed applications. However, there exists a considerable gap in performances between these two classes of algorithms in favor of softdecision algorithms. In order to reduce this gap, in this work we introduce two new improved versions of the hard-decision algorithms, the adaptative gradient descent bit-flipping (AGDBF) and adaptative reliability ratio weighted GDBF (ARRWGDBF). An adaptative weighting and correction factor is introduced in each case to improve the performances of the two algorithms allowing an important gain of bit error rate. As a second contribution of this work a real time implementation of the proposed solutions on a digital signal processor (DSP) is performed in order to optimize and improve the performance of these new approchs. The results of numerical simulations and DSP implementation reveal a faster convergence with a low processing time and a reduction in consumed memory resources when compared to soft-decision algorithms. For the irregular LDPC code, our approachs achieves gains of 0.25 and 0.15 dB respectively for the AGDBF and ARRWGDBF algorithms.
EEE 1001 022 Bootstrapped Low Complexity Iterative Decoding Algorithm
Reliability ratio weighted bit-flipping (RRWBF) algorithm is one of the best hard decision decoding algorithms in performance. Recently several modifications are done to this technique either to improve performance or to lower the complexity. The implementation efficient reliability ratio weighted bit flipping (IERRWBF) is developed targeting decreasing processing time in decoding process. In this paper we are targeting improving performance of a modified low complex IERRWBF version that we have implemented by adding a bootstrap step to the decoding technique which leads to increase in reliability of received bits then number of decoded bits will be increased leading to improve in performance. So decreasing in complexity and improving in performance is accomplished.