Quasi-orthogonal space-time block codes with full diversity

Weifeng Su, X. Xia
{"title":"Quasi-orthogonal space-time block codes with full diversity","authors":"Weifeng Su, X. Xia","doi":"10.1109/GLOCOM.2002.1188366","DOIUrl":null,"url":null,"abstract":"Space-time block codes from orthogonal designs proposed by Alamouti (1998), and Tarokh-Jafarkhani-Calderbank (199) have attracted much attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of a space-time block code from complex orthogonal designs for complex constellations is only 3/4 for three and four transmit antennas. Jafarkhani (see IEEE Trans. Commun., vol.49, no.1, p.1-4, 2001), and Tirkkonen-Boariu-Hottinen (see ISSSTA 2000, pp.429-432, September 2000) proposed space-time block codes from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, these codes still have a fast ML decoding, but do not have the full diversity. In this paper, we design quasi-orthogonal space-time block codes with full diversity by properly choosing the signal constellations. In particular, we propose that half symbols in a quasi-orthogonal design are from a signal constellation A and another half of them are optimal selections from the rotated constellation e/sup j/spl phi// A. The optimal rotation angles /spl phi/ are obtained for some commonly used signal constellations. The resulting codes have both full diversity and fast ML decoding.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2002.1188366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

Abstract

Space-time block codes from orthogonal designs proposed by Alamouti (1998), and Tarokh-Jafarkhani-Calderbank (199) have attracted much attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of a space-time block code from complex orthogonal designs for complex constellations is only 3/4 for three and four transmit antennas. Jafarkhani (see IEEE Trans. Commun., vol.49, no.1, p.1-4, 2001), and Tirkkonen-Boariu-Hottinen (see ISSSTA 2000, pp.429-432, September 2000) proposed space-time block codes from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, these codes still have a fast ML decoding, but do not have the full diversity. In this paper, we design quasi-orthogonal space-time block codes with full diversity by properly choosing the signal constellations. In particular, we propose that half symbols in a quasi-orthogonal design are from a signal constellation A and another half of them are optimal selections from the rotated constellation e/sup j/spl phi// A. The optimal rotation angles /spl phi/ are obtained for some commonly used signal constellations. The resulting codes have both full diversity and fast ML decoding.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有全分集的准正交空时分组码
Alamouti(1998)和Tarokh-Jafarkhani-Calderbank(1999)提出的正交设计的空时分组码由于其快速的最大似然(ML)解码和充分的多样性而引起了人们的广泛关注。然而,复杂星座复正交设计的空时分组码在三天线和四天线发射时的最大符号传输速率仅为3/4。Jafarkhani(参见IEEE Trans)。Commun。第49卷,没有。Tirkkonen-Boariu-Hottinen(参见ISSSTA 2000, pp.429-432, 2000年9月)提出了准正交设计的空时分组码,其中正交性放宽以提供更高的符号传输速率。这些码具有准正交结构,仍然具有快速的ML解码,但不具有充分的多样性。本文通过合理选择信号星座,设计了具有全分集的准正交空时分组码。特别地,我们提出了准正交设计中的一半符号来自信号星座a,另一半符号来自旋转星座e/sup j/spl phi// a的最优选择。对于一些常用的信号星座,我们得到了最优旋转角度/spl phi/。生成的代码具有充分的多样性和快速的ML解码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reconfiguration heuristics for logical topologies in wide-area WDM networks Dependent data broadcasting for unordered queries in a multiple channel mobile environment Performance analysis of TCM with generalized selection combining on Rayleigh fading channels Quasi-orthogonal space-time block codes with full diversity Hybrid flooding and tree-based broadcasting for reliable and efficient link-state dissemination
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1