Gradient-descent decoding of one-step majority-logic decodable codes

TitreGradient-descent decoding of one-step majority-logic decodable codes
Publication TypeJournal Article
Year of Publication2020
AuthorsYatribi, A, Belkasmi, M, Ayoub, F
JournalPhysical Communication
Volume39
Pagination100999
ISSN1874-4907
Mots-clésAWGN channels, Decoding complexity, Difference-set codes, Finite geometry LDPC codes, Gradient-descent decoding, Iterative majority-logic decoding, Maximum likelihood decoding, OSMLD codes
Abstract

In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum–product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required.

URLhttps://www.sciencedirect.com/science/article/pii/S1874490719306184
DOI10.1016/j.phycom.2019.100999
Revues: 

Partenaires

Localisation

Suivez-nous sur

         

    

Contactez-nous

ENSIAS

Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

  Télécopie : (+212) 5 37 68 60 78

  Secrétariat de direction : 06 61 48 10 97

        Secrétariat général : 06 61 34 09 27

        Service des affaires financières : 06 61 44 76 79

        Service des affaires estudiantines : 06 62 77 10 17 / n.mhirich@um5s.net.ma

        Résidences : 06 61 82 89 77

Contacts

    

    Compteur de visiteurs:449,896
    Education - This is a contributing Drupal Theme
    Design by WeebPal.