DocumentCode
3391693
Title
Low-complexity probability generation algorithm for stochastic decoding of non-binary LDPC codes
Author
He, Guanghua ; Bai, Baoming
Author_Institution
State Key Lab. of ISN, Xidian Univ., Xi´´an, China
fYear
2011
fDate
17-19 Aug. 2011
Firstpage
65
Lastpage
70
Abstract
Non-binary LDPC codes offer higher performances than their binary counterpart but suffer from highest decoding complexity. A solution to reduce the decoding complexity is the use of stochastic decoding algorithm, but the computational complexity of probability generation in the first step is very high. In this paper, we propose a simple method to fast generate the probability especially in high-order modulation schemes. Simulation results show that the proposed algorithm causes negligible performance degradation with reduction in computational complexity for stochastic decoding of non-binary LDPC codes, which gives some advantages in hardware implementation of the decoders.
Keywords
computational complexity; decoding; modulation; parity check codes; probability; stochastic processes; computational complexity; decoding complexity; high-order modulation schemes; low density parity check codes; low-complexity probability generation algorithm; nonbinary LDPC codes; stochastic decoding algorithm; Algorithm design and analysis; Computational complexity; Decoding; Modulation; Parity check codes; Probability; Non-binary LDPC codes; approximations; decoder; demodulations; probability; stochastic decoding;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Networking in China (CHINACOM), 2011 6th International ICST Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4577-0100-9
Type
conf
DOI
10.1109/ChinaCom.2011.6158121
Filename
6158121
Link To Document