Frontiers of Information Technology & Electronic Engineering
>> 2015,
Volume 16,
Issue 6
doi:
10.1631/FITEE.1400269
An improved low-complexity sum-product decoding algorithm for low-density parity-check codes
Department of Electronics and Communication Engineering, PSG College of Technology, Coimbatore 641004, India
Available online: 2016-01-05
Next
Previous
Abstract
In this paper, an improved low-complexity sum-product decoding algorithm is presented for low-density parity-check (LDPC) codes. In the proposed algorithm, reduction in computational complexity is achieved by utilizing fast Fourier transform (FFT) with time shift in the check node process. The improvement in the decoding performance is achieved by utilizing an optimized integer constant in the variable node process. Simulation results show that the proposed algorithm achieves an overall coding gain improvement ranging from 0.04 to 0.46 dB. Moreover, when compared with the sum-product algorithm (SPA), the proposed decoding algorithm can achieve a reduction of 42%-67% of the total number of arithmetic operations required for the decoding process.
京公网安备 11010502051620号
