vix.ing · top · new · best · stats · spec

The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian\n Channels

2015/12/21 by Jonathan Scarlett, Vincent Y. F. Tan, Scarlett, Jonathan +3
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Body Area Networks #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1512.06618

openalex publication_date 2015/12/21 · openalex created_date 2022/08/13 · openalex updated_date 2026/07/28

Abstract

We study the second-order asymptotics of information transmission using\nrandom Gaussian codebooks and nearest neighbor (NN) decoding over a\npower-limited stationary memoryless additive non-Gaussian noise channel. We\nshow that the dispersion term depends on the non-Gaussian noise only through\nits second and fourth moments, thus complementing the capacity result\n(Lapidoth, 1996), which depends only on the second moment. Furthermore, we\ncharacterize the second-order asymptotics of point-to-point codes over\nK-sender interference networks with non-Gaussian additive noise.\nSpecifically, we assume that each user's codebook is Gaussian and that NN\ndecoding is employed, i.e., that interference from the K-1 unintended users\n(Gaussian interfering signals) is treated as noise at each decoder. We show\nthat while the first-order term in the asymptotic expansion of the maximum\nnumber of messages depends on the power of the interferring codewords only\nthrough their sum, this does not hold for the second-order term.\n

Related