loading...
Distributed Source Coding Using Raptor Codes for Hidden Markov Sources
March 25-March 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2008.89Data Compression Conference (dcc 2008)
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
In this paper the problem of distributed source coding (DSC) of binary sources with side information at the decoder is addressed. A scheme is proposed based on Raptor codes which are a new class of rateless codes. The decoding scheme is adapted to this problem by implementing a message passing strategy between the constituent decoders of Raptor codes at each decoding iteration. The general case in which the sources are modeled as hidden Markov processes (HMPs) is considered. To exploit the Markovian nature of the sources, a module is added to the decoder to help the estimation process. This module is necessary to achieve good performance.
Index Terms:
Distributed Source coding, Raptor codes, Hidden Markov model
Citation:
M. Fresia, L. Vandendorpe, H. V. Poor, "Distributed Source Coding Using Raptor Codes for Hidden Markov Sources," dcc, pp.517, Data Compression Conference (dcc 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.