新型最小译码复杂度准正交空时分组码的设计

Changhyeon Chae, Daewon Choi, T. Jung
{"title":"新型最小译码复杂度准正交空时分组码的设计","authors":"Changhyeon Chae, Daewon Choi, T. Jung","doi":"10.1093/ietfec/e91-a.10.2990","DOIUrl":null,"url":null,"abstract":"In this paper, a new full-rate space-time block code (STBC) possessing a quasi-orthogonal (QO) property is proposed for QAM and 8 transmit antennas. This code is designed by serially concatenating a real constellation-rotating precoder with the Alamouti scheme. The QO property enables a maximum likelihood (ML) decoding to only require joint detection of four groups of real symbols at a receiver. Hence, this code has an identical and greatly reduced ML decoding complexity with the conventional minimum decoding complexity QO-STBC (MDC- QO-STBC) and the Xian's QO-STBC, respectively. Especially, the proposed QO-STBC is guaranteed to enjoy full diversity for general QAM unlike the existing MDC-QO-STBC presented for only QPSK. By simulation results, we show that the proposed code exhibits the identical and slightly degrade error performance with the existing MDC-QO-STBC for 4-QAM and the Xian's QO-STBC for 4 and 16-QAM, respectively.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Design of New Minimum Decoding Complexity Quasi-Orthogonal Space-Time Block Code for 8 Transmit Antennas\",\"authors\":\"Changhyeon Chae, Daewon Choi, T. Jung\",\"doi\":\"10.1093/ietfec/e91-a.10.2990\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new full-rate space-time block code (STBC) possessing a quasi-orthogonal (QO) property is proposed for QAM and 8 transmit antennas. This code is designed by serially concatenating a real constellation-rotating precoder with the Alamouti scheme. The QO property enables a maximum likelihood (ML) decoding to only require joint detection of four groups of real symbols at a receiver. Hence, this code has an identical and greatly reduced ML decoding complexity with the conventional minimum decoding complexity QO-STBC (MDC- QO-STBC) and the Xian's QO-STBC, respectively. Especially, the proposed QO-STBC is guaranteed to enjoy full diversity for general QAM unlike the existing MDC-QO-STBC presented for only QPSK. By simulation results, we show that the proposed code exhibits the identical and slightly degrade error performance with the existing MDC-QO-STBC for 4-QAM and the Xian's QO-STBC for 4 and 16-QAM, respectively.\",\"PeriodicalId\":299267,\"journal\":{\"name\":\"2007 IEEE International Symposium on Signal Processing and Information Technology\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Signal Processing and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/ietfec/e91-a.10.2990\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Signal Processing and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/ietfec/e91-a.10.2990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对QAM和8个发射天线,提出了一种具有准正交特性的全速率空时分组码(STBC)。该代码是通过将一个真实的星座旋转预编码器与Alamouti方案串行连接而设计的。QO属性使最大似然(ML)解码只需要在接收器上联合检测四组真实符号。因此,该代码与传统的最小解码复杂度QO-STBC (MDC- QO-STBC)和西安的QO-STBC分别具有相同且大大降低的ML解码复杂度。特别是,与现有的仅针对QPSK提出的mdc - qos - stbc不同,所提出的qos - stbc保证在一般QAM中享有充分的多样性。仿真结果表明,本文提出的编码与现有的针对4- qam的MDC-QO-STBC和针对4- qam和16-QAM的Xian’s qc - stbc具有相同的误差性能,且误差性能略有降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Design of New Minimum Decoding Complexity Quasi-Orthogonal Space-Time Block Code for 8 Transmit Antennas
In this paper, a new full-rate space-time block code (STBC) possessing a quasi-orthogonal (QO) property is proposed for QAM and 8 transmit antennas. This code is designed by serially concatenating a real constellation-rotating precoder with the Alamouti scheme. The QO property enables a maximum likelihood (ML) decoding to only require joint detection of four groups of real symbols at a receiver. Hence, this code has an identical and greatly reduced ML decoding complexity with the conventional minimum decoding complexity QO-STBC (MDC- QO-STBC) and the Xian's QO-STBC, respectively. Especially, the proposed QO-STBC is guaranteed to enjoy full diversity for general QAM unlike the existing MDC-QO-STBC presented for only QPSK. By simulation results, we show that the proposed code exhibits the identical and slightly degrade error performance with the existing MDC-QO-STBC for 4-QAM and the Xian's QO-STBC for 4 and 16-QAM, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distribution of a Stochastic Control Algorithm Applied to Gas Storage Valuation Efficient Synthesis of Arbitrary Viewpoint Images Using 3-D Geometric Model and Mesh-Based Specular Reflection Tracing Relative Iris Codes Towards Evaluation of Phonics Method for Teaching of Reading Using Artificial Neural Networks (A Cognitive Modeling Approach) A concept of mathematical methods for the optimization of the post-processing of nuclear resonance spectra of the human skeletal musculature
×
引用
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