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

On the Decomposition Method for 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
$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

4 Author(s)
Haiyang Liu ; Inst. of Microelectron., Chinese Acad. of Sci., Beijing, China ; Wenze Qu ; Bin Liu ; Jie Chen

In this paper, we focus on solving the linear programming (LP) problem that arises in the decoding of low-density parity-check (LDPC) codes by means of the revised simplex method. In order to take advantage of the structure of the LP problem, we reformulate the dual LP and apply the idea of Dantzig-Wolfe (D-W) decomposition method to solve the problem. Each subproblem in the D-W decomposition method is an LP over a convex polyhedral cone. We define the convex polyhedral cone as local parity-check cone and discuss its special structures. Then, we enumerate its extreme rays and use these extreme rays to design an efficient method for the general LP decoding problem. The proposed method exhibits advantages in reducing both the storage and computational requirements.

Published in:

Communications, IEEE Transactions on  (Volume:58 ,  Issue: 12 )

Date of Publication:

December 2010

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.