具有部分CSIT的双用户MISO-MAC的低复杂度、无信息丢失stbc

J. Harshan, B. Rajan
{"title":"具有部分CSIT的双用户MISO-MAC的低复杂度、无信息丢失stbc","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":"{\"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}","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

摘要

本文提出了一种具有低最大似然(ML)译码复杂度和信息无损性的空时分组码(stbc),用于双用户多输入单输出平频衰落多址信道。特别地,提出了两种不同的STBC对,它们是由众所周知的实正交设计派生出来的。第一类码对来自一类称为可分离正交设计的复杂设计,显示为(i)对于任意Nt值(其中Nt表示每个用户的发射天线数量)是信息无损的,(ii)降低了ML解码的复杂性,而第二类码对显示为(i)仅对于大Nt值是信息无损的,(ii)是单符号ML可解码的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Low-complexity, information-lossless STBCs for two-user MISO-MAC with partial CSIT
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信