Optimization of the iterative decoding algorithms for irregular block codes

In this paper, we analyze the performances of iterative decoders for linear block codes. In particular, we consider two modifications of the gradient-descent bit flipping (GDBF) algorithm with momentum, where multiple component decoders with different momentum values are concatenated to improve the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Telecommunications Forum s. 1 - 4
Hlavní autoři: Milojkovic, Jovan, Brkic, Srdjan, Ivanis, Predrag, Vasic, Bane
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 26.11.2024
Témata:
AWGN channels
BCH codes
Block codes
Codes
Decoding
error correction codes
GDBF decoder
genetic algorithm
Genetic algorithms
Iterative algorithms
Iterative decoders
Iterative decoding
Optimization
Telecommunications
ISSN:2994-5828
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í:In this paper, we analyze the performances of iterative decoders for linear block codes. In particular, we consider two modifications of the gradient-descent bit flipping (GDBF) algorithm with momentum, where multiple component decoders with different momentum values are concatenated to improve the decoder performance. The learning parameters of the component decoders are obtained by using a Genetic algorithm based on the database of the uncorrectable error patterns of the previous decoder. We present three optimization strategies and provide a comparison with the state-of-the-art decoders. The numerical results are presented on short Bose-Chaudhuri-Hocquenghem (BCH) codes and the channel with additive white Gaussian noise (AWGN).
ISSN:2994-5828
DOI:10.1109/TELFOR63250.2024.10819061