Research of LDPC decoding based on LLR BP algorithm

In iterations processing of LLR BP algorithm for LDPC decoding, the computational complexity of check nodes renewal is high; The decoding performance will be reduced, while there are lots of loops in short LDPC codes. According to these problems, a new LLR BP decoding algorithm based on Hybrid Check...

Full description

Saved in:
Bibliographic Details
Published in2011 Cross Strait Triple-Regional Radio Science and Wireless Technology Conference Vol. 2; pp. 889 - 892
Main Authors Sun Zengyou, Zhang Jin, Du Juan
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2011
Subjects
Additives
LDPC codes
Modulation
OFDM
Offset BP algorithm
Offset-BP-based algorithm
Tanner graph
Online AccessGet full text
ISBN1424497922
9781424497928
DOI10.1109/CSQRWC.2011.6037098

Cover

More Information
Summary:In iterations processing of LLR BP algorithm for LDPC decoding, the computational complexity of check nodes renewal is high; The decoding performance will be reduced, while there are lots of loops in short LDPC codes. According to these problems, a new LLR BP decoding algorithm based on Hybrid Check-Variable offset processing is proposed in this paper. Decrease complexity by adjusting amplitudes of check nodes processing and relativity of variable nodes by adjusting their information. Simulation results show that this improved decoding algorithm, compared with LLR BP algorithm, is consideration to decoding performance of LDPC and computational complexity.
ISBN:1424497922
9781424497928
DOI:10.1109/CSQRWC.2011.6037098