An iterative joint linear-programming decoding of LDPC codes and finite-state channels


Conference Paper

In this paper, we introduce an efficient method 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 further analyzed by Burshtein. By taking advantage of the dual-domain structure of the joint decoding LP, we obtain a convergent iterative algorithm for joint decoding. Our intent was to find an algorithm very similar to BCJR-based turbo equalization (TE) and it seems that we have succeeded in this respect. The result is an iterative solver for the joint decoding LP 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 with the computational complexity of TE. © 2011 IEEE.

Full Text

Duke Authors

Cited Authors

  • Kim, BH; Pfister, HD

Published Date

  • September 2, 2011

Published In

International Standard Serial Number (ISSN)

  • 0536-1486

International Standard Book Number 13 (ISBN-13)

  • 9781612842332

Digital Object Identifier (DOI)

  • 10.1109/icc.2011.5962814

Citation Source

  • Scopus