2026-09-19T10:44:22Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/937402022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Yury Polyanskiy. Collins, Austin Daniel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2015-02-03T18:31:29Z 2015-02-03T18:31:29Z 2014 2014 http://hdl.handle.net/1721.1/93740 900011145 Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014. Cataloged from PDF version of thesis. Includes bibliographical references (pages 55-56). The Coherent MISO Block Fading Channel is a wireless communication channel model in which the transmitter has access to multiple antennas while the receiver has access to one. This model is becoming increasingly important in communication networks because a base station is often able to use many antennas whereas smaller receivers, such as mobile devices, have a strict size limitation. The capacity of this channel is known, but the finite blocklength limits of codes over this channel is still unknown. In this thesis, we analyze these finite blocklength fundamental limits. Specifically, we give the coding theorem showing the achievable dispersion of this channel. We identify that this channel has non-unique capacity achieving input distributions, and although these distribution all yield the same capacity, some distributions in this set yield a better dispersion than others. We show that orthogonal design input distributions achieve capacity in dimensions where they exist, and that they strictly outperform schemes that purely aim to maximize multiplexing gain from a finite blocklength perspective. by Austin Daniel Collins. S.M. in Computer Science and Engineering 56 pages eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Finite blocklength analysis of the MISO Coherent Block Fading Channel Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f76e2cb3-2a99-4fa9-a660-9ecd6780869f"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Finite blocklength analysis of the MISO Coherent Block Fading Channel</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2014</PublicationDate> <Authors> <Author> <DisplayName>Collins, Austin Daniel</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>The Coherent MISO Block Fading Channel is a wireless communication channel model in which the transmitter has access to multiple antennas while the receiver has access to one. This model is becoming increasingly important in communication networks because a base station is often able to use many antennas whereas smaller receivers, such as mobile devices, have a strict size limitation. The capacity of this channel is known, but the finite blocklength limits of codes over this channel is still unknown. In this thesis, we analyze these finite blocklength fundamental limits. Specifically, we give the coding theorem showing the achievable dispersion of this channel. We identify that this channel has non-unique capacity achieving input distributions, and although these distribution all yield the same capacity, some distributions in this set yield a better dispersion than others. We show that orthogonal design input distributions achieve capacity in dimensions where they exist, and that they strictly outperform schemes that purely aim to maximize multiplexing gain from a finite blocklength perspective.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>