2020/05/30 by Derek Xiao, Xiao, Derek, Linfang Wang +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2006.00344
openalex publication_date 2020/05/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 2C+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 2C+1.2. For AC-AWGN channels, DAB characterizes the evolution of minimum-cardinality finite-support capacity-achieving PMFs.