Computer Science – Information Theory
Scientific paper
2007-10-30
Computer Science
Information Theory
Submitted to European Transactions in Telecommunications, July 2007
Scientific paper
This article proposes a novel iterative algorithm based on Low Density Parity Check (LDPC) codes for compression of correlated sources at rates approaching the Slepian-Wolf bound. The setup considered in the article looks at the problem of compressing one source at a rate determined based on the knowledge of the mean source correlation at the encoder, and employing the other correlated source as side information at the decoder which decompresses the first source based on the estimates of the actual correlation. We demonstrate that depending on the extent of the actual source correlation estimated through an iterative paradigm, significant compression can be obtained relative to the case the decoder does not use the implicit knowledge of the existence of correlation.
Daneshgaran Fred
Laddomada Massimiliano
Mondin Marina
No associations
LandOfFree
LDPC-Based Iterative Algorithm for Compression of Correlated Sources at Rates Approaching the Slepian-Wolf Bound 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 LDPC-Based Iterative Algorithm for Compression of Correlated Sources at Rates Approaching the Slepian-Wolf Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and LDPC-Based Iterative Algorithm for Compression of Correlated Sources at Rates Approaching the Slepian-Wolf Bound will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-365369