High-rate full-diversity space-time block codes with linear receivers

E. Başar, Ümit Aygölü
{"title":"High-rate full-diversity space-time block codes with linear receivers","authors":"E. Başar, Ümit Aygölü","doi":"10.1109/ISWCS.2009.5285363","DOIUrl":null,"url":null,"abstract":"In this paper, we deal with the design of high-rate space-time block codes (STBCs) that achieve full-diversity with linear receivers which enable symbol-wise decoding. We propose three new high-rate coordinate interleaved STBCs and prove that they can achieve full-diversity with linear receivers for any optimally rotated square QAM constellation. Recently, Shang and Xia proved that the symbol rate of an STBC achieving full-diversity with a linear receiver is upper bounded by one complex information symbol per channel use (pcu). However, we show that with the use of coordinate interleaving, the proposed STBCs can exceed this upper bound to 4/3 complex information symbols pcu for two, three and four transmit antennas. For the symbol-by-symbol decoding of the proposed STBCs, we adapt the partial interference cancellation (PIC) group decoding algorithm recently proposed by Guo and Xia, and then further modify this decoder by applying successive interference cancellation (SIC) operation. Simulation results show that when linear receivers with minimum decoding complexity are used, the proposed STBCs achieve better error performance than their counterparts given in the literature.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 6th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2009.5285363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In this paper, we deal with the design of high-rate space-time block codes (STBCs) that achieve full-diversity with linear receivers which enable symbol-wise decoding. We propose three new high-rate coordinate interleaved STBCs and prove that they can achieve full-diversity with linear receivers for any optimally rotated square QAM constellation. Recently, Shang and Xia proved that the symbol rate of an STBC achieving full-diversity with a linear receiver is upper bounded by one complex information symbol per channel use (pcu). However, we show that with the use of coordinate interleaving, the proposed STBCs can exceed this upper bound to 4/3 complex information symbols pcu for two, three and four transmit antennas. For the symbol-by-symbol decoding of the proposed STBCs, we adapt the partial interference cancellation (PIC) group decoding algorithm recently proposed by Guo and Xia, and then further modify this decoder by applying successive interference cancellation (SIC) operation. Simulation results show that when linear receivers with minimum decoding complexity are used, the proposed STBCs achieve better error performance than their counterparts given in the literature.
具有线性接收器的高速率全分集空时分组码
在本文中,我们讨论了高速率空时分组码(stbc)的设计,它可以用线性接收器实现全分集,从而实现符号智能解码。我们提出了三种新的高速率坐标交错stbc,并证明了它们可以在任何最优旋转方形QAM星座的线性接收机上实现全分集。最近,Shang和Xia证明了使用线性接收器实现全分集的STBC的符号速率上限为每信道使用一个复杂信息符号(pcu)。然而,我们表明,通过使用坐标交错,所提出的stbc可以超过这个上限,为2、3和4个发射天线提供4/3个复杂信息符号pcu。对于所提出的stbc的逐符号解码,我们采用了Guo和Xia最近提出的部分干扰抵消(PIC)组解码算法,然后通过逐次干扰抵消(SIC)运算进一步改进该解码器。仿真结果表明,当使用最小解码复杂度的线性接收机时,所提出的stbc比文献中给出的同类stbc具有更好的误差性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信