|
|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2015 Vol.16 No.6 P.511-518
An improved low-complexity sum-product decoding algorithm for low-density parity-check codes
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.
Key words: Computational complexity, Coding gain, Fast Fourier transform (FFT), Low-density parity-check (LDPC) codes, Sum-product algorithm (SPA)
创新点：降低和积译码计算复杂度的同时不损失译码性能。
方法：在校验节点过程中使用时移快速傅里叶变换降低计算复杂度；在变量节点过程中使用优化后的常整数提升译码性能。所提算法性能在Wi-MAX和WLAN中的标准低密度奇偶校验码上测试并验证，且与SPA、SSPA和MSPA进行性能比较（图1-3）。
结论：仿真结果表明，整体上所述算法对编码增益的提高值在0.04到0.46 dB之间；与和积算法（SPA）相比，所述算法可以降低译码过程所需42%-67%的全部代数运算操作。
关键词组：
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
Stylianos Papaharalabos@National Observatory of Athens, Greece<spapaha@noa.gr>
2015-06-10 15:11:25
Very interesting paper. It would be useful in future research works in this field. I am not aware thought, if this idea has been published already by the same or other authors in any of IEEE journals.
DOI:
10.1631/FITEE.1400269
CLC number:
TN911
Download Full Text:
Downloaded:
2958
Download summary:
<Click Here>Downloaded:
1989Clicked:
7004
Cited:
2
On-line Access:
2015-06-04
Received:
2014-07-24
Revision Accepted:
2014-09-25
Crosschecked:
2015-05-07