Capacity Bounds for Additive Symmetric α -Stable Noise Channels

Mauro L. De Freitas, Malcolm Egan, Laurent Clavier, Alban Goupil, Gareth W. Peters, Nourddine Azzaoui

Research output: Contribution to journalArticlepeer-review

35 Citations (Scopus)


mpulsive noise features in many modern communication systems-ranging from wireless to molecular-and is often modeled by the α-stable distribution. At present, the capacity of α-stable noise channels is not well understood, with the exception of Cauchy noise (α = 1) with a logarithmic constraint and Gaussian noise (α = 2) with a power constraint. In this paper, we consider additive symmetric α-stable noise channels with α ∈ (1, 2]. We derive bounds for the capacity with an absolute moment constraint. We then compare our bounds with a numerical approximation via the Blahut-Arimoto algorithm, which provides insight into the effect of noise parameters on the bounds. In particular, we find that our lower bound is in good agreement with the numerical approximation for α near 2.
Original languageEnglish
Pages (from-to)5115-5123
Number of pages9
JournalIEEE Transactions on Information Theory
Issue number8
Early online date2 Mar 2017
Publication statusPublished - Aug 2017


Dive into the research topics of 'Capacity Bounds for Additive Symmetric α -Stable Noise Channels'. Together they form a unique fingerprint.

Cite this