Abstract
Decoding algorithms are used to recover information after its transmission through an unreliable radio channel. Soft decision decoding is very performant in concatenation solutions that exploit many decoding stages. Therefore, we carry out a combination of a symbol-by-symbol decoder, which is Hartmann Rudolph (HR) algorithm, and the Soft Decision Decoder by Hash Techniques (SDHT) as a word-to-word decoder. In this paper, we introduce a concatenation of HR Partially exploited (PHR) and the SDHT algorithm to decode Bose-Chaudhuri-Hocquenghem (BCH) codes. This scheme enables at first to employ Hartmann Rudolph algorithm using only a part of the dual codewords, then the output of PHR is treated by the SDHT. Our proposed serial concatenation guarantees very good performances although we use very low percentage of the dual code space. As instance for the BCH(31, 21, 5) code, the obtained good results are based only on 21.29% of the dual codewords.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Chase D (1972) A class of algorithms for decoding block codes with channel measurement information. IEEE Trans Inf Theory 18:170–181
Hartmann CRP, Rudolph LD (1976) An optimum symbol-by-symbol decoding rule for linear codes. IEEE Trans Inf Theory 22:514–517
Han YS, Hartmann CRP, Chen CC (1991) Efficient maximum likelihood soft-decision decoding of linear block codes using algorithm A*, Technical Report SU-CIS-91-42, School of Computer and Information Science, Syracuse University, Syracuse, NY 13244, December
Maini H, Mehrotra K, Mohan C (1994) Soft-decision decoding of linear block codes using genetic algorithms. In: Proceedings of the IEEE international symposium on information theory, Trondheim, Norway, p 397
Cardoso FA, Arantes DS (1999) Genetic decoding of linear block codes. In: Proceedings of international conference on telecommunications congress on evolutionary computation, Washington, DC, USA, pp 2302–2309
Azouaoui A, Chana I, Belkasmi M (2012) Efficient information set decoding based on genetic algorithms. Int J Commun Netw Syst Sci 5(7):423–429
Azouaoui A, Belkasmi M, Farchane A (2012) Efficient dual domain decoding of linear block codes using genetic algorithms. J Electr Comput Eng. Article ID 503834
Berkani A, Azouaoui A, Belkasmi M, Aylaj B (2017) Improved decoding of linear block codes using compact genetic algorithms with larger tournament size. Int J Comput Sci Issue 14(1):15–24
Azouaoui A, Berkani A, Belkasmi M (2012) An efficient soft decoder of block codes based on compact genetic algorithm. Int J Comput Sci Issue 9(5), No 2:431–438
Nachmani E, Marciano E, Burshtein D, Béery Y (2017) RNN Decoding of linear block codes. arXiv:1702.07560v1 [cs.IT]
Nachmani E, Marciano E, Lugosch L, Gross WJ, Burshtein D, Béery Y (2018) Deep learning methods for improved decoding of linear codes. IEEE J Sel Topics Signal Process 12(1)
Butov VV, Dumachev VN, Fedyaeva SE (2020) Neural net decoders of nonbinary codes. J Phys Conf Ser 1479:012089
El Kasmi Alaoui MS, Nouh S, Marzak A (2019) High speed soft decision decoding of linear codes based on hash and syndrome decoding. Int J Intell Eng Syst 12(1)
El Kasmi Alaoui MS, Nouh S, Marzak A (2019) Two new fast and efficient hard decision decoders based on hash techniques for real time communication systems. In: lecture notes in real-time intelligent systems, RTIS 2017. Advances in intelligent systems and computing, vol 756. Springer, Cham
El Kasmi Alaoui MS, Nouh S, Marzak A (2017) A low complexity soft decision decoder for linear block codes. In: Proceedings of the first international conference on intelligent computing in data sciences
Gross WJ, Doan N, Ngomseu Mambou E, Ali Hashemi, S (2020) Deep learning techniques for decoding polar codes. In: F‐L Luo (ed.) Machine learning for future wireless communications
Elghayyaty M et al (2020) Performance comparison of new designs of Chien search and syndrome blocks for BCH and Reed Solomon codes. Int J Commun Netw Inf Secur 12(2)
Nouh S, Aylaj B (2018) efficient serial concatenation of symbol by symbol and word by word decoders. Int J Innov Comput Inf Control 14
Faham H, El Kasmi Alaoui MS, Nouh S, Azzouazi M (2018) An efficient combination between Berlekamp-Massey and Hartmann Rudolph algorithms to decode BCH codes. Periodic Eng Nat Sci 6(2):365–372
Jung B, Kim T, Lee H (2016) Low-complexity non-iterative soft-decision BCH decoder architecture for WBAN applications. J Semicond Technol Sci 16(4)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Faham, H., El Kasmi Alaoui, M.S., Nouh, S., Azzouazi, M. (2021). High Performance Decoding by Combination of the Hartmann Rudolph Decoder and Soft Decision Decoding by Hash Techniques. In: Motahhir, S., Bossoufi, B. (eds) Digital Technologies and Applications. ICDTA 2021. Lecture Notes in Networks and Systems, vol 211. Springer, Cham. https://doi.org/10.1007/978-3-030-73882-2_71
Download citation
DOI: https://doi.org/10.1007/978-3-030-73882-2_71
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73881-5
Online ISBN: 978-3-030-73882-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)