Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding : (Invited Paper)

We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between convent...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2019 53rd Annual Conference on Information Sciences and Systems (CISS) s. 1 - 5
Hlavní autoři: Sheikh, Alireza, Amat, Alexandre Graell i, Liva, Gianluigi
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2019
Témata:
Decoding
Hamming distance
Iterative decoding
Product codes
Reliability
Throughput
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase-Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.
DOI:10.1109/CISS.2019.8692862