TY - JOUR
T1 - On hard-decision decoding of product codes
AU - Blomqvist, Ferdinand
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2023/5
Y1 - 2023/5
N2 - In this paper we review existing hard-decision decoding algorithms for product codes along with different post-processing techniques used in conjunction with the iterative decoder for product codes. We improve the decoder by Reddy and Robinson and use it to create a new post-processing technique. The performance of this new post-processing technique is evaluated through simulations, and these suggest that our new post-processing technique outperforms previously known post-processing techniques which are not tailored for specific codes. The cost of using the new post-processing technique is that the algorithm becomes more complex. However, the post-processing is applied very rarely unless the channel is very noisy, and hence the increase in computational complexity is negligible for most choices of parameters. Finally, we propose a new algorithm that combines existing techniques in a way that avoids the error floor with short relatively high rate codes. The algorithm should also avoid the error floor with long high rate codes, but further work is needed to confirm this.
AB - In this paper we review existing hard-decision decoding algorithms for product codes along with different post-processing techniques used in conjunction with the iterative decoder for product codes. We improve the decoder by Reddy and Robinson and use it to create a new post-processing technique. The performance of this new post-processing technique is evaluated through simulations, and these suggest that our new post-processing technique outperforms previously known post-processing techniques which are not tailored for specific codes. The cost of using the new post-processing technique is that the algorithm becomes more complex. However, the post-processing is applied very rarely unless the channel is very noisy, and hence the increase in computational complexity is negligible for most choices of parameters. Finally, we propose a new algorithm that combines existing techniques in a way that avoids the error floor with short relatively high rate codes. The algorithm should also avoid the error floor with long high rate codes, but further work is needed to confirm this.
KW - Concatenated codes
KW - Decoding
KW - Linear codes
KW - Product codes
UR - http://www.scopus.com/inward/record.url?scp=85105443351&partnerID=8YFLogxK
U2 - 10.1007/s00200-021-00511-w
DO - 10.1007/s00200-021-00511-w
M3 - Article
AN - SCOPUS:85105443351
SN - 0938-1279
VL - 34
SP - 393
EP - 410
JO - Applicable Algebra in Engineering, Communications and Computing
JF - Applicable Algebra in Engineering, Communications and Computing
IS - 3
ER -