Show simple item record

dc.contributor.authorCollins, Austin
dc.contributor.authorPolyanskiy, Yury
dc.date.accessioned2020-04-17T18:49:30Z
dc.date.available2020-04-17T18:49:30Z
dc.date.issued2018-07
dc.identifier.issn1557-9654
dc.identifier.issn0018-9448
dc.identifier.urihttps://hdl.handle.net/1721.1/124733
dc.description.abstractIn this paper, we consider a channel model that is often used to describe mobile wireless scenarios: Multipleantenna additive white Gaussian noise channels subject to random (fading) gains with full channel state information at the receiver. The dynamics of the fading process are approximated by a piecewise-constant process (frequency non-selective isotropic block fading). This paper addresses the finite blocklength fundamental limits of this channel model. Specifically, we give a formula for the channel dispersion - A quantity governing the delay required to achieve capacity. The multiplicative nature of the fading disturbance leads to a number of interesting technical difficulties that required us to enhance traditional methods for finding the channel dispersion. Alas, one difficulty remains: The converse (impossibility) part of our result holds under an extra constraint on the growth of the peak-power with blocklength. Our results demonstrate, for example, that while the capacities of nt × nr and nr × nt antenna configurations coincide (under fixed received power), the coding delay can be sensitive to this switch. For example, at the received SNR of 20 dB, the 16×100 system achieves capacity with codes of length (delay) which is only 60% of the length required for the 100×16 system. Another interesting implication is that for the MISO channel, the dispersionoptimal coding schemes require employing orthogonal designs such as Alamouti's scheme - A surprising observation considering the fact that Alamouti's scheme was designed for reducing demodulation errors, not improving coding rate. Finding these dispersion-optimal coding schemes naturally gives a criteria for producing orthogonal design-like inputs in dimensions where orthogonal designs do not exist.en_US
dc.description.sponsorshipNational Science Foundation CAREER award (grant CCF-12-53205)en_US
dc.description.sponsorshipNSF (grant CCF-17-17842)en_US
dc.description.sponsorshipCenter for Science of Information (CSoI) (grant CCF-09-39370)en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TIT.2018.2860979en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleCoherent Multiple-Antenna Block-Fading Channels at Finite Blocklengthen_US
dc.typeArticleen_US
dc.identifier.citationCollins, Austin and Polyanskiy,Yury. "Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength." IEEE Transactions on Information Theory 65, 1 (Jan. 2019): 380-405 © 2019 Author(s)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-07-01T18:11:33Z
dspace.date.submission2019-07-01T18:11:35Z
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record