Research of an Improved BP Decoding Algorithm

That the computation load is big is a shortcoming of traditional BP decoding algorithm. According to this shortcoming we give an improved BP decoding algorithm. The decoding algorithm in the iterative decoding process, only need to update the possibility of a wrong bit of information without having...

Full description

Saved in:
Bibliographic Details
Published in:IEEC 2009 : The First International Symposium on Information Engineering and Electronic Commerce : proceedings : 16-17 May 2009 pp. 36 - 39
Main Authors: Guoqiang Wu, Zhaowei Sun
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2009
Subjects:
Arithmetic
AWGN channel
AWGN channels
BP decoding arithmetic
Channel coding
Decoder
Delay effects
Electronic commerce
Iterative algorithms
Iterative decoding
Iterative decoding algorithms
LDPC Code
Parity check codes
Satellites
Sun
ISBN:9780769536866, 0769536867
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:That the computation load is big is a shortcoming of traditional BP decoding algorithm. According to this shortcoming we give an improved BP decoding algorithm. The decoding algorithm in the iterative decoding process, only need to update the possibility of a wrong bit of information without having to update the information whose reliability is very high, raises the decoding efficiency and reduces decoding time delay. The simulation result shows: the calculation load of improved BP decoding algorithms descends distinctively with the increasing iteration numbers; Along with the times increasing of LDPC code iterations upper limit, coding performance can be obviously improved.
ISBN:9780769536866
0769536867
DOI:10.1109/IEEC.2009.14