Lossy Joint Source-Channel Coding in the Finite Blocklength Regime

DOI10.1109/TIT.2013.2238657MaRDI QIDQ2989233zbMATH OpenOpenAlexFDO

Authors Victoria Kostina, Sergio Verdú

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.1317

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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 non-asymptotic 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)approxsqrtnV+kmathcalV(d)Q(epsilon)$, where $C$ and $V$ are the channel capacity and channel dispersion, respectively; $R(d)$ and $mathcalV(d)$ are the source rate-distortion and rate-dispersion functions; and $Q$ is the standard Gaussian complementary cdf. 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 non-asymptotic regime.

Cited in

(7)

• Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
• Output Constrained Lossy Source Coding With Limited Common Randomness
• On the Capacity Loss Due to Separation of Detection and Decoding
• Lossy Coding of Correlated Sources Over a Multiple Access Channel: Necessary Conditions and Separation Results
• Joint Source-Channel Coding With Feedback
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Twenty questions with random error

This page was built for publication: Lossy Joint Source-Channel Coding in the Finite Blocklength Regime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989233)