Cart (Loading....) | Create Account
Close category search window
 

Research of LDPC decoding based on LLR BP algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sun Zengyou ; Dept. of Inf. Eng., Univ. of Northeast Dianli, Jilin, China ; Zhang Jin ; Du Juan

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.

Published in:

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC), 2011  (Volume:2 )

Date of Conference:

26-30 July 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.