By Topic

On the joint source-channel coding error exponent for discrete memoryless systems

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)
Yangfan Zhong ; Dept. of Math. & Stat., Queen''s Univ., Kingston, Ont., Canada ; Alajaji, F. ; Campbell, L.L.

We investigate the computation of Csisza´r's bounds for the joint source-channel coding (JSCC) error exponent EJ of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily computed for arbitrary source-channel pairs via Arimoto's algorithm. When the channel's distribution satisfies a symmetry property, the bounds admit closed-form parametric expressions. We then use our results to provide a systematic comparison between the JSCC error exponent EJ and the tandem coding error exponent ET, which applies if the source and channel are separately coded. It is shown that ET≤EJ≤2ET. We establish conditions for which EJ>ET and for which EJ=2ET. Numerical examples indicate that EJ is close to 2ET for many source-channel pairs. This gain translates into a power saving larger than 2 dB for a binary source transmitted over additive white Gaussian noise (AWGN) channels and Rayleigh-fading channels with finite output quantization. Finally, we study the computation of the lossy JSCC error exponent under the Hamming distortion measure.

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 4 )