On achieving an asymptotically error-free fixed-point of iterative decoding for perfect a priori information

Jorg Kliewer, Daniel J. Costello

Research output: Contribution to journalArticle

Abstract

In this paper we provide necessary and sufficient conditions for constituent codes in (multiple) concatenated and graph-based coding schemes to achieve an asymptotically errorfree iterative decoding fixed-point if the maximum possible a priori information is available. At least one constituent code in an iterative decoding scheme must satisfy these conditions in order to ensure an asymptotically vanishing bit error probability at the convergence point of the decoder. Our results are proved for arbitrary binary-input symmetric memoryless channels (BISMCs) and thus can be universally applied to many transmission scenarios. Specifically, using a factor graph framework, it is shown that non-inner codes in a serial concatenation or check nodes in generalized LDPC codes achieve perfect extrinsic information if and only if the minimum Hamming distance between codewords is two or greater. For inner codes in a serial concatenation, constituent codes in a parallel concatenation, or variable nodes in doubly-generalized LDPC codes the corresponding encoder condition for acquiring perfect extrinsic information is an infinite codeword weight for a weight-one input sequence. For this case we provide a general proof which holds for all linear encoders and BISMCs. We also show that these results can improve the performance of concatenated coding schemes.

Original languageEnglish (US)
Article number6510024
Pages (from-to)2146-2155
Number of pages10
JournalIEEE Transactions on Communications
Volume61
Issue number6
DOIs
StatePublished - Jun 1 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Keywords

  • Code concatenation
  • Extrinsic information transfer functions
  • Factor graphs
  • Iterative decoding

Fingerprint Dive into the research topics of 'On achieving an asymptotically error-free fixed-point of iterative decoding for perfect a priori information'. Together they form a unique fingerprint.

  • Cite this