Journal
IEEE COMMUNICATIONS LETTERS
Volume 27, Issue 4, Pages 1065-1069Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2023.3241950
Keywords
Codes; Reliability; Decoding; Iterative decoding; Euclidean distance; Product codes; Complexity theory; Turbo product code; soft decoding; Chase-Pyndiah algorithm
Categories
Ask authors/readers for more resources
This letter proposes an adaptive Chase-Pyndiah algorithm to improve the error correction performance of Turbo Product Codes (TPCs) with negligible complexity increase. The algorithm adaptively adjusts the weighting factor and reliability factor based on the analog weight of the decision codeword for a component code. Simulation results demonstrate that the proposed algorithm achieves a signal-to-noise ratio (SNR) gain of 0.16 to 0.18 dB at a bit-error-rate (BER) of 10(-6) over additive white Gaussian noise (AWGN) channels.
The Chase-Pyndiah algorithm is a soft decoding algorithm for turbo product codes (TPCs) with promising error correction performance. In this letter, we propose an adaptive Chase-Pyndiah algorithm to improve the error correction performance for TPCs with negligible complexity increase. The proposed algorithm adaptively adjusts the weighting factor and reliability factor according to the analog weight of the decision codeword for a component code. Simulation results show that the proposed algorithm can achieve a signal-to-noise ratio (SNR) gain of 0.16 similar to 0.18 dB at the bit-error-rate (BER) of 10(-6) over additive white Gaussian noise (AWGN) channels.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
