TY - GEN
T1 - A strong converse for joint source-channel coding
AU - Wang, Da
AU - Ingber, Amir
AU - Kochman, Yuval
PY - 2012
Y1 - 2012
N2 - We consider a discrete memoryless joint source-channel setting. In this setting, if a source sequence is reconstructed with distortion below some threshold, we declare a success event. We prove that for any joint source-channel scheme, if this threshold lower (better) than the optimum average distortion, then the success probability approaches zero as the block length increases. Furthermore, we show that the probability has an exponential behavior, and evaluate the optimal exponent. Surprisingly, the best exponential behavior is attainable by a separation-based scheme.
AB - We consider a discrete memoryless joint source-channel setting. In this setting, if a source sequence is reconstructed with distortion below some threshold, we declare a success event. We prove that for any joint source-channel scheme, if this threshold lower (better) than the optimum average distortion, then the success probability approaches zero as the block length increases. Furthermore, we show that the probability has an exponential behavior, and evaluate the optimal exponent. Surprisingly, the best exponential behavior is attainable by a separation-based scheme.
UR - http://www.scopus.com/inward/record.url?scp=84867529830&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6283736
DO - 10.1109/ISIT.2012.6283736
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84867529830
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2117
EP - 2121
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -