By Topic

Distributed Source Coding Using Raptor Codes for Hidden Markov Sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Fresia ; Dept. of Electr. Eng., Princeton Univ., Princeton, NJ ; L. Vandendorpe ; H. V. Poor

In this correspondence, 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 case in which the sources are modeled as independent and identically distributed (i.i.d) processes as well as the more general case in which the sources are modeled as hidden Markov processes (HMPs) are considered. The proposed approach achieves better performance than those achieved by the solutions based on turbo codes, and by the solutions based on regular low density parity check (LDPC) codes when i.i.d. sources are considered. On the other hand, when modeling sources as HMPs, an additional module to exploit the underlying Markovian nature is necessary to achieve good performance.

Published in:

IEEE Transactions on Signal Processing  (Volume:57 ,  Issue: 7 )