To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in per...To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sot~ decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation （ABP） and box and match algorithm （BMA）, which are serially concatenated by the accumulated log-likelihood ratio （ALLR）. Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoff between the decoding performance and complexity.展开更多
The soft cancellation decoding of polar codes achieves a better performance than the belief propagation decoding with lower computational time and space complexities.However,because the soft cancellation decoding is b...The soft cancellation decoding of polar codes achieves a better performance than the belief propagation decoding with lower computational time and space complexities.However,because the soft cancellation decoding is based on the successive cancellation decoding,the decoding efficiency and performance with finite-length blocks can be further improved.Exploiting the idea of the successive cancellation list decoding,the soft cancellation decoding can be improved in two aspects:one is by adding branch decoding to the error-prone information bits to increase the accuracy of the soft information,and the other is through using partial iterative decoding to reduce the time and computational complexities.Compared with the original method,the improved soft cancellation decoding makes progress in the error correction performance,increasing the decoding efficiency and reducing the computational complexity,at the cost of a small increase of space complexity.展开更多
基金supported by the National Natural Science Foundation of China(60472104)
文摘To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon （RS） codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sot~ decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation （ABP） and box and match algorithm （BMA）, which are serially concatenated by the accumulated log-likelihood ratio （ALLR）. Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoff between the decoding performance and complexity.
文摘The soft cancellation decoding of polar codes achieves a better performance than the belief propagation decoding with lower computational time and space complexities.However,because the soft cancellation decoding is based on the successive cancellation decoding,the decoding efficiency and performance with finite-length blocks can be further improved.Exploiting the idea of the successive cancellation list decoding,the soft cancellation decoding can be improved in two aspects:one is by adding branch decoding to the error-prone information bits to increase the accuracy of the soft information,and the other is through using partial iterative decoding to reduce the time and computational complexities.Compared with the original method,the improved soft cancellation decoding makes progress in the error correction performance,increasing the decoding efficiency and reducing the computational complexity,at the cost of a small increase of space complexity.
