LDPC-Based Iterative Algorithm for Compression of Correlated Sources at Rates Approaching the Slepian-Wolf Bound

Simple item page
dc.creatorDaneshgaran, F.
dc.creatorLaddomada, Massimiliano
dc.creatorMondin, M.
dc.date2007-10-30
dc.date.accessioned2026-07-07T08:39:28Z
dc.date.available2026-07-07T08:39:28Z
dc.descriptionThis 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.
dc.descriptionSubmitted to European Transactions in Telecommunications, July 2007
dc.identifierhttps://arxiv.org/abs/0710.5640
dc.identifierhttp://arxiv.org/abs/0710.5640
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141083
dc.subjectInformation Theory
dc.titleLDPC-Based Iterative Algorithm for Compression of Correlated Sources at Rates Approaching the Slepian-Wolf Bound
dc.typetext

Files

Collections

arXiv