Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory
Yangfan Zhong; Alajaji, F.; Campbell, L.L.;
Information Theory, IEEE Transactions on
Volume 53,  Issue 12,  Dec. 2007 Page(s):4457 - 4472
Abstract:

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.
Abstract | Full Text: PDF(681 KB)    IEEE JNL
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2008 IEEE – All Rights Reserved