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 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).

Authors

Institutions

Publication Details

Published
2024-11-26
DOI
https://doi.org/10.1109/telfor63250.2024.10819061
Citations
1
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
0.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of the iterative decoding algorithms for irregular block codes

Bane Vasić, Srdjan Brkić, Predrag Ivaniš, Jovan Milojković
1 citations
Advanced Data Compression Techniques
0.25
article

Optimization of the iterative decoding algorithms for irregular block codes

Bane Vasić, Srdjan Brkić, Predrag Ivaniš, Jovan Milojković
article en
1 citations

Abstract

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).

University of Arizona (US), University of Belgrade (RS)
Science Fund of the Republic of Serbia
Openalex Percentile: Top 43%
Advanced Data Compression Techniques
0.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.