The Dispersion of Joint Source-Channel Coding

Abstract

In this work we investigate the behavior of the distortion threshold that can be guaranteed in joint source-channel coding, to within a prescribed excess-distortion probability. We show that the gap between this threshold and the optimal average distortion is governed by a constant that we call the joint source-channel dispersion. This constant can be easily computed, since it is the sum of the source and channel dispersions, previously derived. The resulting performance is shown to be better than that of any separation-based scheme. For the proof, we use unequal error protection channel coding, thus we also evaluate the dispersion of that setting.

Extended version of work presented in the 2011 Allerton conference

References in corpus (1)

• The Dispersion of Lossy Source Coding

Cited by in corpus (12)

• A Technique for Deriving One-Shot Achievability Results in Network Information Theory
• Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information
• Fixed Error Asymptotics For Erasure and List Decoding
• Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
• Rateless Lossy Compression via the Extremes
• Joint source-channel coding with feedback
• Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs
• A Case Where Interference Does Not Affect The Channel Dispersion
• Second-Order and Moderate Deviation Asymptotics for Successive Refinement
• Channels with cost constraints: strong converse and dispersion
• Finite-Length Bounds for Joint Source-Channel Coding with Markovian Source and Additive Channel Noise to Achieve Large and Moderate Deviation Bounds
• On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder