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

@article{Thangaraj2017CapacityBF, title={Capacity Bounds for Discrete-Time, Amplitude-Constrained, Additive White Gaussian Noise Channels}, author={Andrew Thangaraj and Gerhard Kramer and Georg B{\"o}cherer}, journal={IEEE Transactions on Information Theory}, year={2017}, volume={63}, pages={4172-4182} }

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to derive analytic capacity upper bounds for scalar and vector AWGN channels. The scalar bound improves on McKellips’ bound and is within 0.1 bit of capacity for all signal-to-noise ratios (SNRs). The 2-D bound is within 0.15 bits of capacity provably up to 4.5 dB…

## 35 Citations

A Sphere Packing Bound for Vector Gaussian Fading Channels under Peak Amplitude Constraints

- Computer Science, Mathematics
- 2021

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints and it extends to MIMO channels notable results from the geometric analysis on thecapacity of scalar Gaussian channels.

Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with Fading

- Computer Science, Mathematics2020 IEEE International Symposium on Information Theory (ISIT)
- 2020

Evaluated capacity bounds for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) fading channels subject to input amplitude constraints at high signal-to-noise ratio.

Capacity and degree-of-freedom of OFDM channels with amplitude constraint

- Mathematics, Computer Science2016 IEEE International Symposium on Information Theory (ISIT)
- 2016

This paper study how the capacity and degree-of-freedom (DoF) scaling for the continuous-time amplitude limited AWGN channels in radio frequency (RF) and intensity modulated optical communication (OC) channels varies in terms of the OFDM block transmission time T, bandwidth W, amplitude A and the noise spectral density N0/2.

A Sphere Packing Bound for AWGN MIMO Fading Channels under Peak Amplitude Constraints

- Computer Science2020 IEEE Information Theory Workshop (ITW)
- 2021

An upper bound on the capacity of multiple-input multiple-output (MIMO) additive white Gaussian noise fading channels is derived under peak amplitude constraints. The tightness of the bound is…

Finite-Support Capacity-Approaching Distributions for AWGN Channels

- Computer Science, Mathematics2020 IEEE Information Theory Workshop (ITW)
- 2021

This paper modifies DAB to include a power constraint and finds low-cardinality PMFs that approach capacity on PC-AWGN Channels and uses it to find capacity-achieving PMFs with small cardinality support sets for AC-AW GN Channels.

Upper and Lower Bounds on the Capacity of Amplitude-Constrained MIMO Channels

- Mathematics, Computer ScienceGLOBECOM 2017 - 2017 IEEE Global Communications Conference
- 2017

Novel upper and lower bounds on the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived and it is shown that the capacity scales linearly with the minimum of the numbers of transmit and receive antennas.

An Upper Bound on the Number of Mass Points in the Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel

- Mathematics, Computer Science2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

An alternative proof of the finiteness of the number shells of the capacity-achieving input distribution is provided and the first firm upper bound on the number of shells is produced, paving an alternative way for approaching many such problems.

An Upper Bound for the Capacity of Amplitude-Constrained Scalar AWGN Channel

- Physics, Computer ScienceIEEE Communications Letters
- 2016

This letter slightly improves the upper bound in Thangaraj et al. for the capacity of the amplitude-constrained scalar Additive White Gaussian Noise (AWGN) channel. This improvement makes the upper…

The MISO free-space optical channel at low and moderate SNR

- Computer Science, Physics2018 52nd Annual Conference on Information Sciences and Systems (CISS)
- 2018

Two analytic upper bounds on the capacity of the MISO channel are presented: the first closely follows the proposed numerical lower bounds in the low-SNR regime, and the second one can improve on previous limits in the moderate- SNR regime.

Amplitude Constrained MIMO Channels: Properties of Optimal Input Distributions and Bounds on the Capacity †

- Mathematics, MedicineEntropy
- 2019

The capacity of multiple-input multiple-output channels that are subject to constraints on the support of the input is studied and it is shown that the capacity scales linearly with the minimum between the number of transmit and receive antennas, similar to the case of average power-constrained inputs.

## References

SHOWING 1-10 OF 26 REFERENCES

Capacity upper bounds for discrete-time amplitude-constrained AWGN channels

- Mathematics, Computer Science2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

A dual capacity expression is used to derive analytic capacity upper bounds for scalar and vector AWGN channels and the scalar bound improves on McKellips' bound and is within 0.1 bits of capacity for all signal-to-noise ratios (SNRs).

Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 2003

It is demonstrated that, for high signal-to-noise ratio (SNR), the capacity of such channels typically grows only double-logarithmically in the SNR, and introduced the fading number as the second-order term in the high-SNR asymptotic expansion of capacity.

Peak-to-Average Power Ratio of Good Codes for Gaussian Channel

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2014

It is shown that the codes achieving this tradeoff must necessarily have peak-to-average power ratio (PAPR) proportional to logarithm of the blocklength, and to PAPR measured at the output of an orthogonal frequency division multiplexing modulator.

The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels

- Computer Science, MathematicsInf. Control.
- 1971

An Upper Bound for the Capacity of Amplitude-Constrained Scalar AWGN Channel

- Physics, Computer ScienceIEEE Communications Letters
- 2016

This letter slightly improves the upper bound in Thangaraj et al. for the capacity of the amplitude-constrained scalar Additive White Gaussian Noise (AWGN) channel. This improvement makes the upper…

Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2005

This work study the capacity-achieving probability measure for conditionally Gaussian channels subject to bounded-input constraints and average cost constraints, and shows that the channel capacity is achievable and the measure is proved to be discrete.

Characterizing the discrete capacity achieving distribution with peak power constraint at the transition points

- Mathematics2008 International Symposium on Information Theory and Its Applications
- 2008

The capacity-achieving input distribution for many channels like the additive white Gaussian noise (AWGN) channels under a peak power constraint is discrete with a finite number of mass points. The…

On the Capacity of Free-Space Optical Intensity Channels

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2009

Upper and lower bounds are derived on the capacity of the free-space optical intensity channel. This channel has a nonnegative input (representing the transmitted optical intensity), which is…

The capacity of average and peak-power-limited quadrature Gaussian channels

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1995

The capacity C(/spl rho//sub a/) of the discrete-time quadrature additive Gaussian channel (QAGC) with inputs subjected to (normalized) average and peak power constraints, provides an improved ultimate upper bound on the reliable information rates transmitted over the QAGC with any communication systems subjected to bothaverage and peak-power limitations.

Dual capacity upper bounds for noisy runlength constrained channels

- Mathematics, Computer Science2016 IEEE Information Theory Workshop (ITW)
- 2016

Simplified versions of the bounds are presented, which improve upon previously known computable bounds and show that feedback strictly improves the capacity of the runlength constrained BEC and BSC for all parameters.