.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Low-density parity-check (LDPC) codes
linear programming (LP) decoding
revised simplex method
Dantzig-Wolfe (D-W) decomposition
local parity-check cone
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly通过超快激光图案化和动力学调节的材料组装进行三维纳米加工.png)
Science
OAAI
ScienceIF0
OAAI分享收藏分享收藏
查看更多内容