Lossy Joint Source-Channel Coding in the Finite Blocklength Regime

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 bloc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 59; no. 5; pp. 2545 - 2575
Main Authors: Kostina, V., Verdu, S.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Achievability
Applied sciences
Channel coding
Codes
Coding theory
Coding, codes
converse
Dispersion
Distortion measurement
Exact sciences and technology
finite blocklength regime
Gaussian approximation
Information theory
Information, signal and communications theory
joint source-channel coding (JSCC)
Joints
lossy source coding
memoryless sources
Normal distribution
Probability
rate-distortion theory
Shannon theory
Signal and communications theory
Source coding
Symbols
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Performance evaluation
finite blocklength regime
Channel capacity
Probabilistic approach
Source coding
Dispersive channel
Rate distortion theory
Gaussian distribution
n channel
Lossy medium
Shannon theory
Joint source channel coding
Information transmission
Achievability
Research and development
memoryless sources
Memoryless channel
rate-distortion theory
lossy source coding
Distribution function
converse
joint source-channel coding (JSCC)
Memoryless source
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ε 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 ) ≈ √( nV + k V ( d )) Q -1 (ε), 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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2238657