Near-LSPA Performance at MSA Complexity
Instituto de Telecomunicacoes, Dept. of Electrical & Computer Engineering, University of Coimbra, Portugal
IEEE International Conference on Communications (ICC), 2013
@article{andrade2013near,
title={Near-LSPA Performance at MSA Complexity},
author={Andrade, Joao and Falcao, Gabriel and Silva, Vitor and Barreto, Joao P and Goncalves, Nuno and Savin, Valentin},
year={2013}
}
The tradeoff between error-correcting performance and numerical complexity of LDPC decoding algorithms is a well-known problem. In this paper we depict the unseen error-floor performance of the Self-Corrected Min-Sum algorithm for long length DVB-S2 codes. We developed a massively parallel simulation using GPUs which allowed a comprehensive BER characterization either in the waterfall or in the error-floor region. We show that the self-correction technique increases the BER performance by 0:5 and 0:2 dB, in the waterfall and error-floor region, when compared to the Min-Sum algorithm. Furthermore, it reaches within 0:2 dB to the Logarithmic Sum-Product BER performance and it also outperforms the Normalized Min-Sum at high SNR, a low complexity decoding algorithm which yields good BER performance.
July 15, 2013 by hgpu
