期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 59, 期 5, 页码 2545-2575出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2013.2238657
关键词
Achievability; converse; finite blocklength regime; joint source-channel coding (JSCC); lossy source coding; memoryless sources; rate-distortion theory; Shannon theory
资金
- National Science Foundation (NSF) [CCF-1016625]
- Center for Science of Information, an NSF Science and Technology Center [CCF-0939370]
- Natural Sciences and Engineering Research Council of Canada
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [1016625] Funding Source: National Science Foundation
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the nonasymptotic regime. A joint source-channel code maps a block of k source symbols onto a length-n channel codeword, and the fidelity of reproduction at the receiver end is measured by the probability epsilon that the distortion exceeds a given threshold d. For memoryless sources and channels, it is demonstrated that the parameters of the best joint source-channel code must satisfy, nC - kR(d) approximate to root nV + kV(d)Q(-1) (epsilon), where C and V are the channel capacity and channel dispersion, respectively; R(d) and V(d) are the source rate-distortion and rate-dispersion functions; and Q is the standard Gaussian complementary cumulative distribution function. Symbol-by-symbol (uncoded) transmission is known to achieve the Shannon limit when the source and channel satisfy a certain probabilistic matching condition. In this paper, we show that even when this condition is not satisfied, symbol-by-symbol transmission is, in some cases, the best known strategy in the nonasymptotic regime.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据