By Topic

Modified multistage linear programming decoding of LDPC codes

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
$33 $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

2 Author(s)
Xian Zhang ; Sch. of Inf. Sci. & Eng., Shandong Univ., Jinan, China ; Piming Ma

Linear programming (LP) decoding is getting more and more attention because of the maximum-likelihood (ML) certificate property. As one of the improved LP decoding methods, multistage LP (MLP) decoding has been proposed to improve the performance of LP decoding but at the cost of higher complexity. In this paper, the problem of achieving a balance between the performance and the complexity of LP decoding is considered. First, a criterion used for searching new constraints adaptively is proposed. Then a modified MLP decoding is presented by incorporating the adaptive decoding algorithm to decrease the complexity. The presented modified MLP decoding can obtain a good tradeoff between the performance and the complexity and is proved also has the ML certificate characteristic. Simulations with moderate block length LDPC codes show that the proposed MLP decoding achieves the same BER performance as the original MLP decoding with far fewer used constraints and faster convergence speed consequently.

Published in:

Communication Technology (ICCT), 2011 IEEE 13th International Conference on

Date of Conference:

25-28 Sept. 2011