A weighted group shuffled decoding for low-density parity-check codes

Fatima Zahrae Zenkouar (Sidi Mohamed Ben Abdellah University)
Mustapha El Alaoui (Sidi Mohamed Ben Abdellah University)
Said Najah (Sidi Mohamed Ben Abdellah University)

Indonesian Journal of Electrical Engineering and Computer Science
Vol 25, No 1: January 2022

In this paper, we have developed several concepts such as the tree concept, the short cycle concept and the group shuffling concept of a propagation cycle to decrypt low-density parity-check (LDPC) codes. Thus, we proposed an algorithm based on group shuffling propagation where the probability of occurrence takes exponential form exponential factor appearance probability belief propagation-group shuffled belief propagation (EFAP-GSBP). This algorithm is used for wireless communication applications by providing improved decryption performance with low latency. To demonstrate the effectiveness of our suggested technique EFAP-GSBP, we ran numerous simulations that demonstrated that our algorithm is superior to the traditional BP/GSBP algorithm for decrypting LPDC codes in both regular and non-regular forms