Computer Science – Information Theory
Scientific paper
2010-09-22
Computer Science
Information Theory
To appear in Proc. IEEE ICC 2011, Kyoto, Japan, June 5-9, 2011
Scientific paper
In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density 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-based turbo equalization (TE). The result is a joint iterative decoder whose complexity is similar to TE but whose performance is similar to joint LP decoding. The main advantage of this decoder is that it appears to provide the predictability of joint LP decoding and superior performance with the computational complexity of TE.
Kim Byung-Hak
Pfister Henry D.
No associations
LandOfFree
An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-637894