Simulated Annealing Decoder for Linear Block Codes

  title={Simulated Annealing Decoder for Linear Block Codes},
  author={Lahcen Niharmine and Hicham Bouzkraoui and Ahmed Azouaoui and Youssef Hadi},
  journal={J. Comput. Sci.},
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… 


Simulated Annealing Decoding of Linear Block Codes
The simulations show that the Simulated Annealing decoder has the same performance as the Berlekamp-Massey Algorithm (BM) and is more efficient compared to other Decoder based on Genetic algorithms in terms of performance and run time.
Efficient Information Set Decoding Based on Genetic Algorithms
A hard-decision decoding technique based on Genetic Algorithms (HDGA) is described, which is applicable to the general case of error correcting codes where the only known structure is given by the generating matrix G.
Genetic Algorithms for Soft-Decision Decoding of Linear Block Codes
A new crossover operator is defined that exploits domain-specific information and compare it with uniform and two-point crossover and achieves bit-error-probabilities as low as 0.00183 for a [104,52] code with a low signal-to-noise ratio.
Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms
The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes.
Decoding of Block Codes by using Genetic Algorithms and Permutations Set
An efficient stop criterion is proposed and it reduces considerably the decoding complexity of the algorithm and shows that the proposed decoder is less complex than its competitors that are based also on genetic algorithms.
A genetic-algorithm based decoder for low density parity check codes
The performance of the proposed decoder is very close to that of the optimal sum-product decoder, with the additional benefit of not requiring channel information (signal-to-noise ratio), and the fitness function and parameters of the GA can be optimized.
Soft-decision decoding of linear block codes based on ordered statistics
A novel approach to soft decision decoding for binary linear block codes that achieves a desired error performance progressively in a number of stages and is terminated at the stage where either near-optimum error performance or a desired level of error performance is achieved.
A new genetic decoding of Linear Block Codes
In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check
Applying Hybrid Simulated Annealing Algorithm to the Information Sets Search Problem
An exploratory analysis is performed about the use of the technique by using IS hybrid heuristic of Simulated Annealing with Genetic Algorithm to perform comparative search on how many IS performance is capable of covering the modified solution compared to the IS in its original form.
Class of algorithms for decoding block codes with channel measurement information
  • D. Chase
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1972
It is shown that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved, and computer simulations indicate that even for SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures.