A New Information Lossless STBC for 2 Transmit Antennas with Reduced-Complexity ML Decoding

P. Rabiei, N. Al-Dhahir
{"title":"A New Information Lossless STBC for 2 Transmit Antennas with Reduced-Complexity ML Decoding","authors":"P. Rabiei, N. Al-Dhahir","doi":"10.1109/VETECF.2007.171","DOIUrl":null,"url":null,"abstract":"A new information lossless, full-rate space-time block code is presented for 2 transmit antennas over 2 symbol periods. We show that our code is capacity-achieving and exploit its special algebraic structure to derive a reduced-complexity maximum-likelihood (ML) decoding algorithm. When the number of receive antennas is greater than 1, our code outperforms the Alamouti code. Comparing the performance of our code with state-of-the-art B2Phi and Golden codes in [4] and [7], demonstrates competitive performance for practical low-to-medium SNR ranges, for high spectral efficiencies, and as the number of receive antennas increases while requiring much lower ML decoding complexity.","PeriodicalId":261917,"journal":{"name":"2007 IEEE 66th Vehicular Technology Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 66th Vehicular Technology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECF.2007.171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

A new information lossless, full-rate space-time block code is presented for 2 transmit antennas over 2 symbol periods. We show that our code is capacity-achieving and exploit its special algebraic structure to derive a reduced-complexity maximum-likelihood (ML) decoding algorithm. When the number of receive antennas is greater than 1, our code outperforms the Alamouti code. Comparing the performance of our code with state-of-the-art B2Phi and Golden codes in [4] and [7], demonstrates competitive performance for practical low-to-medium SNR ranges, for high spectral efficiencies, and as the number of receive antennas increases while requiring much lower ML decoding complexity.
一种新的具有低复杂度ML解码的双发射天线信息无损STBC
针对2个发射天线的2个符号周期,提出了一种新的信息无损全速率空时分组码。我们证明了我们的代码是容量实现的,并利用其特殊的代数结构推导出一个降低复杂性的最大似然(ML)解码算法。当接收天线的数量大于1时,我们的代码优于Alamouti代码。将我们的代码与[4]和[7]中最先进的B2Phi和Golden代码的性能进行比较,证明了在实际的中低信噪比范围、高频谱效率以及随着接收天线数量的增加而需要更低的ML解码复杂性的情况下,具有竞争力的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信