We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Joint source-channel coding of binary sources with side information at the decoder using IRA codes

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
$31 $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)
Liveris, A.D. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Zixiang Xiong ; Georghiades, C.N.

We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder. A special case of this problem is joint source-channel coding for a nonequiprobable memoryless binary source. The theoretical limits of this problem are given by combining the Slepian-Wolf theorem, the source entropy in the special case, with the channel capacity. The approach is based on viewing the correlation between the binary source output and the side information as a separate channel or an enhancement of the original channel. The joint source-channel encoding, decoding and code design procedures are explained in detail. The simulated performance results are better than the recently published solutions using turbo codes and very close to the theoretical limit.

Published in:

Multimedia Signal Processing, 2002 IEEE Workshop on

Date of Conference:

9-11 Dec. 2002