Performance analysis of a reduced complexity decoding algorithm based on an improved offset min-sum approximation
Michaelraj Kingston Roberts, Parthibaraj Anguraj · 2018
The phenomenal growth in the field of wireless communication has increased the need for secure data transmission and reception over noisy channel conditions. In this context, many soft decision based LDPC decoding algorithms are considered as a prime front runner for meeting the requirements of good error rate performance with minimal decoding complexity. This paper presents a reduced complexity decoding algorithm based on an improved offset approximation. The results of this work is analyzed through numerical simulations in terms of error rate performance and convergence speed. The experimental results demonstrate that the proposed scheme attains enhanced decoding stability with a faster rate of convergence without enhancing the computational complexity.