2011 IEEE International Conference on Communications (ICC) 2011
DOI: 10.1109/icc.2011.5962814
|View full text |Cite
|
Sign up to set email alerts
|

An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels

Abstract: Abstract-In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of lowdensity parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding, proposed by Vontobel and Koetter and explored by Burshtein, to this problem. By taking advantage of the dual-domain structure of the joint decoding LP, we obtain a convergent iterative algorithm for joint LP decoding whose structure is similar to BCJR… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…For these applications, an efficient iterative solver for the joint-decoding LP would have favorable properties: error floors predictable by pseudo-codeword analysis and convergence based on a well-defined optimization problem. Therefore, we introduce a novel iterative solver for the joint LP decoding problem whose per-iteration complexity (e.g., memory and time) is similar to that of TE but whose performance appears to be superior at high SNR [17] [20].…”
Section: A Motivation and Problem Statementmentioning
confidence: 99%
“…For these applications, an efficient iterative solver for the joint-decoding LP would have favorable properties: error floors predictable by pseudo-codeword analysis and convergence based on a well-defined optimization problem. Therefore, we introduce a novel iterative solver for the joint LP decoding problem whose per-iteration complexity (e.g., memory and time) is similar to that of TE but whose performance appears to be superior at high SNR [17] [20].…”
Section: A Motivation and Problem Statementmentioning
confidence: 99%