Simulated Annealing Decoding of Linear Block Codes

In this paper, we present a hard-decision decoding algorithm using Simulated Annealing (SA) technique. The main idea is to find the optimal solution of the transmitted codeword by a process hopping between two different tasks. The simulations, applied on some binary linear block codes over the AWGN channel, show that the Simulated Annealing decoder has the same performance as the Berlekamp-Massey Algorithm (BM). Furthermore SA Decoder is more efficient compared to other Decoder based on Genetic algorithms in terms of performance and run time.