FIND ME ON

GitHub

LinkedIn

Upper Bound on Channel Capacity

🌱

Theorem
InfoTheory

Theorem

The capacity C(P)C(P) of the discrete-time memoryless additive noise channel with input power constraint PP, whose noise {Zi}\{Z_{i}\} has mean 00 and variance σ2\sigma^{2}, satisfies CG(P)+D(ZZG)C(P)C_{G}(P)+D(Z\|Z_{G})\ge C(P)where ZGN(0,σ2)Z_{G}\sim\mathcal{N}(0,\sigma^{2}) (i.e. ZGZ_{G} is Gaussian noise) and D(ZZG)D(Z\|Z_{G}) is the divergence between channel noise ZZ and ZGZ_{G} called the “non-Gaussianness of the noise ZZ”.