A beta-beta achievability bound with applications
Name
A beta-beta.pdf
Size
512.78 KB
Format
Adobe PDF
Checksum (MD5)
4a7ae7d5edc5558f171b60b612dbdea7
Author(s)
Yang, Wei
Durisi, Giuseppe
Poor, H. Vincent
Collins, Austin Daniel
Polyanskiy, Yury
Date Issued
August 2016
Journal
2016 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Yang, Wei, et al. "A Beta-Beta Achievability Bound with Applications." 2016 IEEE International Symposium on Information Theory (ISIT), 10-15 July, 2016, Barcelona, Spain, IEEE, 2016, pp. 2669–73.
Version
Original manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2016.7541783
