Gaussian channels and the optimal coding

Abstract

For the Gaussian channel Y(t) = [Phi]([xi](s), Y(s); s [less, double equals] t) + X(t), the mutual information I([xi], Y) between the message [xi](·) and the output Y(·) is evaluated, where X(·) is a Gaussian noise. Furthermore, the optimal coding under average power constraints is constructed.Gaussian channel mutual information canonical representation of Gaussian processes reproducing kernel Hilbert space optimal coding