Lossy Source-Channel Coding Theorem

Theorem (Lossy Source-Channel Coding Theorem)

Suppose the DMS {Xi}i=1\{ X_{i} \}_{i=1}^\infty has rate distortion function R(D)R(D) and the DMC has capacity CC then

  1. Forward Part: For any D>0D>0 such that R(D)<CR(D)<C {(fnsc,gnsc)}\exists \{ (f_{n}^{sc},g_{n}^{sc}) \} of lossy source-channel codes such that lim supnE[d(Xn,X^n)]D\limsup_{ n \to \infty } E[d(X^{n},\hat{X}^{n})]\le D
  2. Converse: For any blocklength nn, if the lossy source-channel code (fnsc,gnsc)(f_{n}^{sc},g_{n}^{sc}) has distortion E[d(Xn,X^n)]DE[d(X^{n},\hat{X}^n)]\le Dthen we must have that R(D)CR(D)\le C