Papers
Topics
Authors
Recent
2000 character limit reached

Finite-Support Capacity-Approaching Distributions for AWGN Channels

Published 30 May 2020 in cs.IT and math.IT | (2006.00344v1)

Abstract: In this paper, the Dynamic-Assignment Blahut-Arimoto (DAB) algorithm identifies finite-support probability mass functions (PMFs) with small cardinality that achieve capacity for amplitude-constrained (AC) Additive White Gaussian Noise (AWGN) Channels, or approach capacity to within less than 1% for power-constrained (PC) AWGN Channels. While a continuous Gaussian PDF is well-known to be a theoretical capacity-achieving distribution for the PC-AWGN channel, DAB identifies PMFs with small-cardinality that are, for practical purposes, indistinguishable in performance. We extend the results of Ozarow and Wyner that require a constellation cardinality of $2{C+1}$ to approach capacity C to within the shaping loss. PMF's found by DAB approach capacity with essentially no shaping loss with constellation cardinality of $2{C+1.2}$. For AC-AWGN channels, DAB characterizes the evolution of minimum-cardinality finite-support capacity-achieving PMFs.

Citations (10)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.