Channel Coding for Gaussian Channels with Multifaceted Power Constraints
This work offers more precise benchmarks for practical modulation schemes, addressing a domain-specific problem in communication theory, though it is incremental as it generalizes existing power constraint models.
The paper tackles the problem of characterizing coding performance for Gaussian channels under multifaceted power constraints, providing an exact characterization of the minimum average error probability as a function of first- and second-order coding rates through refined asymptotic analysis.
Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power $Î$ as well as on finer statistics of the input power. We introduce a multifaceted power model in which the expectation of an arbitrary (but finite) number of arbitrary functions of the normalized average power is constrained. The framework generalizes existing models, recovering the standard maximal and expected power constraints and the recent mean and variance constraint as special cases. Under certain growth and continuity assumptions on the functions, our main theorem gives an exact characterization of the minimum average error probability for Gaussian channels as a function of the first- and second-order coding rates. The converse proof reduces the code design problem to minimization over a compact (under the Prokhorov metric) set of probability distributions, characterizes the extreme points of this set and invokes the Bauer's maximization principle. Our results for the multifaceted power model serve as more precise benchmarks for practical modulation schemes with multiple amplitude levels, probabilistic shaping and nonuniform constellation geometries.