.png){kind=icon}
Return
On the Decomposition Method for Linear Programming Decoding of LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2010.102910.090490.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Low-density parity-check (LDPC) codes
linear programming (LP) decoding
revised simplex method
Dantzig-Wolfe (D-W) decomposition
local parity-check cone
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly.png)
Science
OAAI
ScienceIF0
OAAIShareSaveShareSaveShareSaveShareSave
ShareSave
View more