Channel Coding for Gaussian Channels With Mean and Variance Constraints

We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main technical contribution of this paper is an achievability scheme which uses random codewords drawn from a mixture of three uniform distributions on (n−1)-spheres of radii R1,R2 and R3, where Ri = O( √ n) and |Ri − Rj | = O(1). To analyze such a mixture distribution, we prove a lemma giving a uniform O(log n) bound, which holds with high probability, on the log ratio of the output distributions Qcci and Qccj, where Qcci is induced by a random channel input uniformly distributed on an (n − 1)-sphere of radius Ri. To facilitate the application of the usual central limit theorem, we also give a uniform O(log n) bound, which holds with high probability, on the log ratio of the output distributions Qcci and Q∗i, where Q∗i is induced by a random channel input with i.i.d. components.