By Topic

Link between Sum-Product and Gradient Projection Decoding of LDPC Codes: An Intermediate 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)
Beaudonnet, M. ; Centre For Commun. Syst. Res. (CCSR), Univ. of Surrey, Guildford ; Kasparis, C. ; Evans, B.G.

This paper investigates the connection between the classical sum-product (SP) decoder for low density parity check (LDPC) codes and the recently proposed gradient projection (GP) decoding scheme presented in (Kasparis and Evans, 2007). A graphical model for GP is exhibited based on which we derive an intermediate algorithm which establishes a bridge between graphical based algorithms (SP and variants) and an optimization based algorithm (GP). A more practical decoding algorithm with improved performance and reduced complexity is also proposed. A complexity analysis is provided and performance are studied through Monte-Carlo simulations.

Published in:

Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE

Date of Conference:

11-14 May 2008