Open AccessA weighted group shuffled decoding for low-density parity-check codes
Author(s) -
Fatima Zahrae Zenkouar,
Mustapha El Alaoui,
S. Arivazhagan
Publication year - 2022
Publication title -
indonesian journal of electrical engineering and computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.241
H-Index - 17
eISSN - 2502-4760
pISSN - 2502-4752
DOI - 10.11591/ijeecs.v25.i1.pp375-381
Subject(s) - shuffling , low density parity check code , belief propagation , decoding methods , computer science , exponential function , algorithm , group (periodic table) , cryptography , theoretical computer science , ciphertext , encryption , mathematics , computer network , mathematical analysis , chemistry , organic chemistry , programming language
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