On hard-decision decoding of product codes
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- Decoding binary block codes on<tex>Q</tex>-ary output channels
- Error-erasure decoding of product codes (Corresp.)
- scientific article; zbMATH DE number 4064915 (Why is no real title available?)
- scientific article; zbMATH DE number 3668503 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3596729 (Why is no real title available?)
- Near-optimum decoding of product codes: Block turbo codes
- Random error and burst correction by iterated codes
Cited in
(5)
This page was built for publication: On hard-decision decoding of product codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157856)