{"title":"Low-complexity, information-lossless STBCs for two-user MISO-MAC with partial CSIT","authors":"J. Harshan, B. Rajan","doi":"10.1109/NCC.2010.5430212","DOIUrl":null,"url":null,"abstract":"In this paper, Space-Time Block Codes (STBCs) with low Maximum-Likelihood (ML) decoding complexity and information-losslessness property are proposed for a two-user Multiple-Input Single-Output, frequency-flat fading multiple access channel. In particular, two distinct classes of STBC pairs which are derived from the well known class of real orthogonal designs are proposed. The first class of code pairs which are derived from a class of complex designs called separable orthogonal designs are shown to be (i) information-lossless for arbitrary values of Nt (where Nt denotes the number of transmit antennas of each user) and (ii) have reduced ML decoding complexity whereas the second class of code pairs are shown to be (i) information-lossless only for large values of Nt and (ii) are singlesymbol ML decodable.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 National Conference On Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2010.5430212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, Space-Time Block Codes (STBCs) with low Maximum-Likelihood (ML) decoding complexity and information-losslessness property are proposed for a two-user Multiple-Input Single-Output, frequency-flat fading multiple access channel. In particular, two distinct classes of STBC pairs which are derived from the well known class of real orthogonal designs are proposed. The first class of code pairs which are derived from a class of complex designs called separable orthogonal designs are shown to be (i) information-lossless for arbitrary values of Nt (where Nt denotes the number of transmit antennas of each user) and (ii) have reduced ML decoding complexity whereas the second class of code pairs are shown to be (i) information-lossless only for large values of Nt and (ii) are singlesymbol ML decodable.