Sciweavers

Share
ICASSP
2009
IEEE

Robust and fast non asymmetric distributed source coding using turbo codes on the syndrome trellis

8 years 11 months ago
Robust and fast non asymmetric distributed source coding using turbo codes on the syndrome trellis
We consider the distributed compression of two (binary memoryless) correlated sources and propose a unique codec that can reach any point in the Slepian-Wolf region. In a previous method based on channel codes, the decoder multiply the compressed data by an inverse submatrix of the code. This multiplication presents two drawbacks. First, if turbo codes are used, the submatrix has no periodic structure s.t. the whole inverse has to be stored and no fast implementation exists for the multiplication. Second, this multiplication may lead to error propagation. In this paper, we propose a method that is both robust and fast.
Velotiaray Toto-Zarasoa, Aline Roumy, Christine Gu
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where ICASSP
Authors Velotiaray Toto-Zarasoa, Aline Roumy, Christine Guillemot, Cédric Herzet
Comments (0)
books