Super-Linear Growth of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel

TL;DR

This paper demonstrates that the number of support points of the optimal input distribution for an amplitude-constrained AWGN channel grows faster than linearly as the amplitude constraint increases, revealing new growth behavior.

Contribution

The paper introduces a novel method to establish the first non-trivial lower bound showing super-linear growth of the support size with respect to the amplitude constraint.

Findings

Support size grows super-linearly with amplitude A

First non-trivial lower bound established

Improves understanding of capacity-achieving input distributions

Abstract

We study the growth of the support size of the capacity-achieving input distribution for the amplitude-constrained additive white Gaussian noise (AWGN) channel. While it is known since Smith (1971) that the optimal input is discrete with finitely many mass points, tight bounds on the number of support points $K_A$ as the amplitude constraint $A$ increases remain open. Not much is known until recently, when Dytso et al. (2019) proved that $K_A$ grows at least linearly and at most quadratically in $A$. Here, we provide a novel method, building on Ma et al. (2024); Zhang (1994), to derive the first non-trivial lower bound showing that KA grows super-linearly in A.