By Topic

Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory

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, ON ; Alajaji, F. ; Campbell, L.L.

We study the error exponent, EJ, for reliably transmitting a discrete stationary ergodic Markov (SEM) source Q over a discrete channel W with additive SEM noise via a joint source-channel (JSC) code. We first establish an upper bound for EJ in terms of the Renyi entropy rates of the source and noise processes. We next investigate the analytical computation of EJ by comparing our bound with Gallager's lower bound (1968) when the latter one is specialized to the SEM source-channel system. We also note that both bounds can be represented in Csiszar's form (1980), as the minimum of the sum of the source and channel error exponents. Our results provide us with the tools to systematically compare EJ with the tandem (separate) coding exponent EJ. We show that as in the case of memoryless source-channel pairs EJ les 2Er and we provide explicit conditions for which EJ > ET. Numerical results indicate that EJ ap 2ET for many SEM source-channel pairs, hence illustrating a substantial advantage of JSC coding over tandem coding for systems with Markovian memory.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 12 )