.png){kind=icon}
Return
FFT Based Sum-Product Algorithm for Decoding LDPC Lattices
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2012.073112.120996.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
LDPC lattices were introduced by Sadeghi et al. in [13] and have a good performance under generalized min-sum and sum-product algorithms. The high complexity of these algorithms is mainly due to the search for local valid codewords in each check node process. In addition, when the dimension of such lattices is increased, these decoding algorithms are very time-consuming. In this paper, we propose an FFT based sum-product algorithm to decode LDPC lattices. In the check node process, using the FFT method reduces the check node complexity from O(d(c)g(2)) to O(d(c)g log g) where d(c) is the degree of a check equation and g is the alphabet size of an LDPC lattice. As a result, with almost the same complexity cost, we have a significant improvement over the performance of the min-sum based decoding 2-level LDPC lattices with the symbol error probability smaller than 10(-5) at SNR = 1.5 dB.
Keywords:
LDPC lattice
Sum-product algorithm
FFT method
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
ShareSaveThree iodocuprate hybrids symmetrically modulated by positional isomers and the chiral conformation of N-benzyl-methylpyridinium.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more