Skip to main content

A Beta-Beta Achievability Bound with Applications

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

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1f77r
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Wei-
dc.contributor.authorCollins, Austin-
dc.contributor.authorDurisi, Giuseppe-
dc.contributor.authorPolyanskiy, Yury-
dc.contributor.authorPoor, H Vincent-
dc.date.accessioned2020-02-19T21:59:48Z-
dc.date.available2020-02-19T21:59:48Z-
dc.date.issued2016en_US
dc.identifier.citationYang, 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.en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1f77r-
dc.description.abstractA 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.en_US
dc.format.extent2669-2673en_US
dc.language.isoen_USen_US
dc.relation.ispartofIEEE International Symposium on Information Theoryen_US
dc.rightsAuthor's manuscripten_US
dc.titleA Beta-Beta Achievability Bound with Applicationsen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1109/ISIT.2016.7541783-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
OA_Beta_Beta_Achievability_Bound_Applications.pdf628.74 kBAdobe PDFView/Download


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