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

Alaoui, My Seddiq El Kasmi; Nouh, Saïd; Marzak, Abdelaziz

doi:10.1007/978-981-15-0947-6_12

Cited by 2 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Fig. 6(a), we plot the error correction performances of PHR Chase, SD1 [23], PHR-ARDecGA [35], Chase-HSDec [33], PHR-SPDA [35] and ocGAD [37] for the BCH(63, 51, 5) code. From this Fig.…”

Section: B Simulation Results and Comparison With Other Decodersmentioning

confidence: 99%

“…Recently, we find several decoding algorithms that are defined by concatenating two serial decoders [16,33,35,36]. In [16], the authors proposed to use the HR algorithm partially with a reduced number of dual code words and correct just symbols whose reliability is below a threshold, then to use a second decoder to complete the decoding of the recovered sequence at the output of the HR decoder.…”

Section: The Proposed Decodermentioning

confidence: 99%

“…There are many articles that present deep learning algorithms for error correction [26]- [29]. Several works use hashing techniques to speed up the decoding process and therefore have reduced complexity in execution time [30]- [35]. There are also decoders developed by serial concatenation of two decoders [16,34,35,36].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved Decoding of Linear Block Codes by Concatenated Decoders

Alaoui*,

Joundan,

Nouh

et al. 2020

IJRTE

Self Cite

View full text Add to dashboard Cite

The use of decoding algorithms allows us to retrieve information after transmitting it over a noisy communication channel. Soft decision decoding is powerful in concatenation schemes that use two or more levels of decoding. In our case, we make a concatenation between the Hartmann & Rudolph (HR) algorithm as symbol-by-symbol decoder and the chase-2 algorithm that is word-to-word decoding algorithm. In this paper, we propose to combine two decoding algorithms for constructing a new one with more efficiency and less complexity. This work consists firstly to use the HR with a reduced number of codewords of the dual code then the Chase-2 algorithm which exploits the output of PHR. The simulations results and the comparisons made show that the proposed decoding scheme guarantees very good performance with reduced temporal complexity.

show abstract

Section: B Simulation Results and Comparison With Other Decodersmentioning

confidence: 99%

Section: The Proposed Decodermentioning

confidence: 99%