具有高编码增益的快速可解码全速率STBC,适用于4 × 2 MIMO系统

Ming Liu, M. Hélard, J. Hélard, M. Crussiére
{"title":"具有高编码增益的快速可解码全速率STBC,适用于4 × 2 MIMO系统","authors":"Ming Liu, M. Hélard, J. Hélard, M. Crussiére","doi":"10.1109/PIMRC.2013.6666222","DOIUrl":null,"url":null,"abstract":"In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4 × 2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M4,5) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A fast decodable full-rate STBC with high coding gain for 4 × 2 MIMO systems\",\"authors\":\"Ming Liu, M. Hélard, J. Hélard, M. Crussiére\",\"doi\":\"10.1109/PIMRC.2013.6666222\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4 × 2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M4,5) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.\",\"PeriodicalId\":210993,\"journal\":{\"name\":\"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2013.6666222\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2013.6666222","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种新的快速可解码空时分组码(STBC)。编码是全速率和全分集的4 × 2多输入多输出(MIMO)传输。由于码字的独特结构,所提出的代码需要更低的计算复杂度来提供最大似然(ML)解码性能。结果表明,当使用M-ary方形QAM星座时,ML解码复杂度仅为0 (M4,5)。最后,在文献中已知的快速可解码stbc中,所提出的代码具有最高的最小行列式。仿真结果表明,该码在现有的stbc中具有最佳的误码率性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A fast decodable full-rate STBC with high coding gain for 4 × 2 MIMO systems
In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4 × 2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code requires a much lower computational complexity to provide maximum-likelihood (ML) decoding performance. It is shown that the ML decoding complexity is only O(M4,5) when M-ary square QAM constellation is used. Finally, the proposed code has highest minimum determinant among the fast-decodable STBCs known in the literature. Simulation results prove that the proposed code provides the best bit error rate (BER) performance among the state-of-the-art STBCs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Experimental validation of fog models for FSO under laboratory controlled conditions EWMA-triggered waterfilling for reduced-complexity resource management in ad-hoc connections Sleep scheduling in IEEE 802.16j relay networks A comparison of implicit and explicit channel feedback methods for MU-MIMO WLAN systems Optimization of collaborating secondary users in a cooperative sensing under noise uncertainty
×
引用
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