J. Hoydis, Romain Couillet, P. Piantanida, M. Debbah
{"title":"A random matrix approach to the finite blocklength regime of MIMO fading channels","authors":"J. Hoydis, Romain Couillet, P. Piantanida, M. Debbah","doi":"10.1109/ISIT.2012.6283838","DOIUrl":null,"url":null,"abstract":"This paper provides a novel central limit theorem (CLT) for the information density of the MIMO Rayleigh fading channel under white Gaussian inputs, when the data blocklength n and the number of transmit and receive antennas K and N, respectively, are large but of similar order of magnitude. This CLT is used to derive closed-form upper bounds on the error probability via an input-constrained version of Feinstein's lemma by Polyanskiy et al. and the second-order approximation of the coding rate. Numerical evaluations suggest that the normal approximation is tight for reasonably small values of n, K, N.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2012.6283838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
This paper provides a novel central limit theorem (CLT) for the information density of the MIMO Rayleigh fading channel under white Gaussian inputs, when the data blocklength n and the number of transmit and receive antennas K and N, respectively, are large but of similar order of magnitude. This CLT is used to derive closed-form upper bounds on the error probability via an input-constrained version of Feinstein's lemma by Polyanskiy et al. and the second-order approximation of the coding rate. Numerical evaluations suggest that the normal approximation is tight for reasonably small values of n, K, N.