@article {10.3844/jcssp.2018.1174.1189,
article_type = {journal},
title = {Simulated Annealing Decoder for Linear Block Codes},
author = {Niharmine, Lahcen and Bouzkraoui, Hicham and Azouaoui, Ahmed and Hadi, Youssef},
volume = {14},
number = {8},
year = {2018},
month = {Sep},
pages = {1174-1189},
doi = {10.3844/jcssp.2018.1174.1189},
url = {https://thescipub.com/abstract/jcssp.2018.1174.1189},
abstract = {In this study, we introduce a novel soft decoder, the first of its kind, for linear block codes, based on Simulated Annealing algorithm (SA). The main enhancement in our contribution which let our decoder over performs with large gain (about 3 dB at 710-4) the classical SA approach, is to take the most reliable information set of the received codeword as a start solution and also according to this reliability generate neighbor’s solutions. Besides, our algorithm performance is enhanced by reducing search space when we involve the code error correcting capability parameter. The performance of the designed algorithm is investigated through a parameter tuning process and then compared with other various decoding algorithms in terms of decoding performance and algorithmic complexity. Simulation results, show that our algorithm over performs its competitor decoders while keeping minimum computation cost. In fact, our algorithm has large gain over Chase-2 and GAMD, furthermore, it over performs the most efficient and up to date DDGA decoder by 2 dB at 10-5 for RS codes.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}