Computer Science – Information Theory
Scientific paper
2009-10-06
Computer Science
Information Theory
8 pages, to appear in Allerton '09
Scientific 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.
Narayanan Krishna R.
Pfister Henry D.
Yedla Arvind
No associations
LandOfFree
Can Iterative Decoding for Erasure Correlated Sources be Universal? 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 Can Iterative Decoding for Erasure Correlated Sources be Universal?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Can Iterative Decoding for Erasure Correlated Sources be Universal? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35375