Capacity Bounds for Discrete-Time, Amplitude-Constrained, Additive White\n Gaussian Noise Channels

2015/11/27 by Andrew Thangaraj, Gerhard Kramer, Thangaraj, Andrew +3 · 2 citations
Engineering · #Wireless Communication Security Techniques #Advanced Wireless Communication Techniques #Power Line Communications and Noise

paper · pdf · doi:10.48550/arxiv.1511.08742

Abstract

The capacity-achieving input distribution of the discrete-time, additive\nwhite Gaussian noise (AWGN) channel with an amplitude constraint is discrete\nand seems difficult to characterize explicitly. A dual capacity expression is\nused to derive analytic capacity upper bounds for scalar and vector AWGN\nchannels. The scalar bound improves on McKellips' bound and is within 0.1 bits\nof capacity for all signal-to-noise ratios (SNRs). The two-dimensional bound is\nwithin 0.15 bits of capacity provably up to 4.5 dB, and numerical evidence\nsuggests a similar gap for all SNRs.\n

Cited by

• An Improved Lower Bound on Cardinality of Support of the Amplitude-Constrained AWGN Channel
• Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints

Related

• An Improved Lower Bound on Cardinality of Support of the Amplitude-Constrained AWGN Channel
• The Capacity of the Amplitude-Constrained Vector Gaussian Channel
• Super-Linear Growth of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel
• An Upper Bound for the Capacity of Amplitude-Constrained Scalar AWGN\n Channel
• Some Generalizations of the Capacity Theorem for AWGN Channels