Communication is transfer of information from source to sink or sender to receiver. The signal when transferred through the noisy channel gets affected by the noise and becomes an error signal when it reaches the receiver. Decoding is the process of retrieving the correct information from the received signal. The weighted bit flipping LDPC decoding algorithm gives a good performance in retrievi...

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme...

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

<span lang="EN-US">It is proved that hard decision algorithms are more appropriate than a soft for low-density parity-check (LDPC) decoding since they less complex at the level. On other hand, it notable algorithm outperforms one in terms of bit error rate (BER) gap. In order to minimize BER and gap between these two families LDPC codes, new suggested this paper, which based on both norma...

In this paper it is shown that multi GDBF algorithm exhibits much faster convergence as compared to the single GDBF algorithm. The multi GDBF algorithm require less iterations when compared to the single GDBF algorithm for the search point to closely approach the local maximum point taking into consideration the gradient descent bit flipping (GDBF) algorithms exhibiting better decoding performa...

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 cho...

In this work, we introduce a novel decoding algorithm named “Reliability Ratio Weighted Bit Flipping–Sum Product” (RRWBFSP) is proposed for regular LDPC codes. “Sum [4] and Flipping” [6] are two separate methods that combined in the new algorithm. The simulations show to exceed Sum-Product algorithms by 0.34 dB. addition, when compared Sum-Product, RRWBFSP approach has about same computational ...