A Beta-Beta Achievability Bound with Applications

Author(s): Yang, Wei; Collins, Austin; Durisi, Giuseppe; Polyanskiy, Yury; Poor, H Vincent

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1f77r
 Abstract: A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson β functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verdú (2014). The new bound turns out to simplify considerably the analysis in situations where the channel output distribution is not a product distribution, for example due to a cost constraint or a structural constraint (such as orthogonality or constant composition) on the channel inputs. Connections to existing bounds in the literature are discussed. The bound is then used to derive 1) the channel dispersion of additive non-Gaussian noise channels with random Gaussian codebooks, 2) the channel dispersion of an exponential-noise channel, 3) a second-order expansion for the minimum energy per bit of an additive white Gaussian noise channel, and 4) a lower bound on the maximum coding rate of a multiple-input multiple-output Rayleigh-fading channel with perfect channel state information at the receiver, which is the tightest known achievability result. Publication Date: 2016 Citation: Yang, W., Collins, A., Durisi, G., Polyanskiy, Y., & Poor, H. V. (2016). A beta-beta achievability bound with applications. IEEE International Symposium on Information Theory (ISIT), 2669-2673. DOI: 10.1109/ISIT.2016.7541783 Pages: 2669-2673 Type of Material: Conference Article Journal/Proceeding Title: IEEE International Symposium on Information Theory Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.