Can iterative decoding for erasure correlated sources be universal?


Conference Paper

In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of two erasure correlated sources with transmission over different erasure channels. Our main interest is in determining whether or not various code ensembles can achieve the capacity region universally over varying channel conditions. We consider two ensembles in the class of low-density generator-matrix (LDGM) codes known as Luby-Transform (LT) codes and one ensemble of low-density parity-check (LDPC) codes.We analyze them using density evolution and show that optimized LT codes can achieve the extremal symmetric point of the capacity region. We also show that LT codes are not universal under iterative decoding for this problem because they cannot simultaneously achieve the extremal symmetric point and a corner point of the capacity region. The sub-universality of iterative decoding is characterized by studying the density evolution for LT codes. ©2009 IEEE.

Full Text

Duke Authors

Cited Authors

  • Yedla, A; Pfister, HD; Narayanan, KR

Published Date

  • December 1, 2009

Published In

  • 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Start / End Page

  • 408 - 415

International Standard Book Number 13 (ISBN-13)

  • 9781424458714

Digital Object Identifier (DOI)

  • 10.1109/ALLERTON.2009.5394794

Citation Source

  • Scopus