Fast and Efficient Decoding Algorithm Developed from Concatenation Between a Symbol-by-Symbol Decoder and a Decoder Based on Syndrome Computing and Hash Techniques

Abstract

The exchange of data is done through a communication channel that is not entirely reliable and these data are most likely to be altered by errors. In order to detect and correct any errors on the receiver side, error-correcting codes are used; their principle is to add control data on the transmitter side. The Hartmann and Rudolph (HR) algorithm is based on a probabilistic study to determine if a bit of the received sequence is equal to 0 or 1. To do this, it exploits all the codewords of the dual code, which makes its complexity very high. The efficiency and the low complexity of the hard-decision decoder based on hash and syndrome decoding (HSDec) algorithm compared with its competitors encouraged us to use it in a serial concatenation with the HR decoder. In this paper, we propose a mutual cooperation between the HR partially exploited (PHR) and HSDec decoders. The simulation results show the efficiency and the rapidity of the proposed cooperation. The best performance qualities obtained using PHR-HSDec against HR alone prove the robustness of this cooperation.