.png){kind=icon}
.png){kind=icon}
Return
Adaptive Binary Slepian-Wolf Decoding using Particle Based Belief Propagation
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2011.061511.100214.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A major difficulty that plagues the practical use of Slepian-Wolf (SW) coding (and distributed source coding in general) is that the precise correlation among sources needs to be known a priori. To resolve this problem, we propose an adaptive asymmetric SW decoding scheme using particle based belief propagation (PBP). We explain the adaptive scheme for asymmetric setup in detail and then further extend it to the non-asymmetric setup based on the code partitioning approach. Moreover, we introduce a Metropolis-Hastings (MH) algorithm in the resampling step, which efficiently decreases the number of simulation iterations. We show through experiments that the proposed algorithm can simultaneously reconstruct the compressed sources and estimate the joint correlation among sources. Further, comparing to the conventional SW decoder based on standard belief propagation, the proposed approach can achieve higher compression under varying correlation statistics.
Keywords:
Adaptive decoding
distributed algorithms
source coding
data compression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W