Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Publication
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The compression is done by two separate compressors without any exchange of information between them. The decompressor uses a Belief propagation algorithm in conjunction with the Blind Iterative Doping strategy. Simulation results indicate performance close to the Slepian-Wolf limit.
Michael Christoph Gastpar, Erixhen Sula