Capacity bounds for discrete-time, amplitude-constrained, additive white Gaussian noise channels

Andrew Thangaraj, Gerhard Kramer, Georg Böcherer

Research output: Contribution to journalArticlepeer-review

55 Scopus citations

Abstract

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; numerical evidence suggests a similar gap for all SNRs. As the SNR tends to infinity, these bounds are accurate and match with a volume-based lower bound. For the 2-D complex case, an analytic lower bound is derived by using a concentric constellation and is shown to be within 1 bit of capacity.

Original languageEnglish
Article number7894270
Pages (from-to)4172-4182
Number of pages11
JournalIEEE Transactions on Information Theory
Volume63
Issue number7
DOIs
StatePublished - Jul 2017

Keywords

  • Additive white Gaussian noise channel
  • Amplitude constraint
  • Capacity

Fingerprint

Dive into the research topics of 'Capacity bounds for discrete-time, amplitude-constrained, additive white Gaussian noise channels'. Together they form a unique fingerprint.

Cite this