In this section
@article{Campello:2019:10.1109/TIT.2018.2875004,
author = {Campello, A and Dadush, D and Ling, C},
doi = {10.1109/TIT.2018.2875004},
journal = {IEEE Transactions on Information Theory},
pages = {1961--1971},
title = {AWGN-goodness is enough: capacity-achieving lattice codes based on dithered probabilistic shaping},
url = {http://dx.doi.org/10.1109/TIT.2018.2875004},
volume = {65},
year = {2019}
}
TY - JOUR
AB - In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under lattice decoding and non-uniform signalling. Unlike previous results in the literature, our scheme holds with no extra condition on the lattices (e.g. quantization-goodness or vanishing flatness factor), thus establishing a direct implication between AWGNgoodness, in the sense of Poltyrev, and capacity-achieving codes. Our analysis uses properties of the discrete Gaussian distribution in order to obtain precise bounds on the probability of error and achievable rates. In particular, we obtain a simple characterization of the finite-blocklength behavior of the scheme, showing that it approaches the optimal dispersion coefficient for high signalto- noise ratio. We further show that for low signal-to-noise ratio the discrete Gaussian over centered lattice constellations cannot achieve capacity, and thus a shift (or “dither”) is essentially necessary.
AU - Campello,A
AU - Dadush,D
AU - Ling,C
DO - 10.1109/TIT.2018.2875004
EP - 1971
PY - 2019///
SN - 0018-9448
SP - 1961
TI - AWGN-goodness is enough: capacity-achieving lattice codes based on dithered probabilistic shaping
T2 - IEEE Transactions on Information Theory
UR - http://dx.doi.org/10.1109/TIT.2018.2875004
UR - http://hdl.handle.net/10044/1/64716
VL - 65
ER -
