Search

This letter focuses on improving the error correction performance of the extended min‐sum (EMS) decoding algorithm. Introducing factor/offset modifications in the check node update process of the EMS algorithm can improve the performance. Based on this, the authors propose a novel threshold‐based modified EMS algorithm that introduces the factor/offset in a targeted manner by setting a threshold for the posterior probability. Simulation results show that an additional performance gain of the order of 0.08 dB is obtained with the proposed method without significantly increasing the complexity of the method. [ABSTRACT FROM AUTHOR]

In this Letter, a list decoding algorithm is proposed for the semi-random block-oriented convolutional code (SRBO-CC). To decode each sub-frame, a list of candidates are serially computed until finding a qualified one or achieving maximum list, where the correctness of the decoding candidate is checked by a statistical threshold. Simulation results show that SRBO-CC with list decoding is competitive with polar codes and that the performance-complexity tradeoffs can be achieved by adjusting the statistical threshold. [ABSTRACT FROM AUTHOR]

Since the polar code was discovered by Arikan, many decoding methods have been proposed, one of which is the belief propagation (BP) decoding. Its inherent high parallel level makes it suitable for high-speed applications. A novel BP decoder based on a modified three-by-three kernel matrix is proposed. The corresponding decoding algorithm and frozen bits selection method are presented. The numerical results show that it has a similar error correcting capability compared with the original polar BP decoder. More importantly, the message memory requirement can be reduced from O(N log2 N) to O (N log3 N), and the decoding delay can be reduced accordingly. [ABSTRACT FROM AUTHOR]