Efficient MIMO detection by successive projection

Karen Su, I. Wassell
{"title":"Efficient MIMO detection by successive projection","authors":"Karen Su, I. Wassell","doi":"10.1109/ISIT.2005.1523631","DOIUrl":null,"url":null,"abstract":"This paper presents a new MIMO detector based on successive projection of the received signal onto the faces of the lattice induced by the channel matrix. Analysis of the relationship between successive algorithms like V-BLAST and the maximum likelihood (ML) sphere decoder, which share a common underlying tree structure, leads to the design of the successive projection algorithm (SPA). Although it is a suboptimal detector, we prove theoretically that when ML detection can be realized in a successive manner, i.e., without back-tracking, ML performance is also achieved by the SPA. The advantageous implications of this result are illustrated via simulation of the average bit error rates attained over a 4 times 4 MIMO flat fading channel. For instance, at a target error rate of 10-3 using 16-QAM modulation, a 2.8 dB improvement over the popular V-BLAST detector is observed at a comparable complexity. We also demonstrate a parameterized SPA, which offers performance profiles approaching that of an ML detector","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523631","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper presents a new MIMO detector based on successive projection of the received signal onto the faces of the lattice induced by the channel matrix. Analysis of the relationship between successive algorithms like V-BLAST and the maximum likelihood (ML) sphere decoder, which share a common underlying tree structure, leads to the design of the successive projection algorithm (SPA). Although it is a suboptimal detector, we prove theoretically that when ML detection can be realized in a successive manner, i.e., without back-tracking, ML performance is also achieved by the SPA. The advantageous implications of this result are illustrated via simulation of the average bit error rates attained over a 4 times 4 MIMO flat fading channel. For instance, at a target error rate of 10-3 using 16-QAM modulation, a 2.8 dB improvement over the popular V-BLAST detector is observed at a comparable complexity. We also demonstrate a parameterized SPA, which offers performance profiles approaching that of an ML detector
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于连续投影的高效MIMO检测
本文提出了一种新的MIMO检测器,该检测器基于接收信号在信道矩阵诱导的晶格表面上的连续投影。分析了V-BLAST等连续算法与最大似然球解码器(ML)之间的关系,它们具有共同的底层树结构,从而设计了连续投影算法(SPA)。虽然它是一个次优检测器,但我们从理论上证明,当机器学习检测可以以连续的方式实现时,即没有回溯,SPA也可以实现机器学习性能。通过模拟4 × 4 MIMO平坦衰落信道的平均误码率,说明了这一结果的有利意义。例如,在使用16-QAM调制的目标错误率为10-3时,在相当的复杂性下,可以观察到比流行的V-BLAST检测器提高2.8 dB。我们还演示了一个参数化的SPA,它提供了接近ML检测器的性能概况
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Upper bounds on the rate of LDPC codes as a function of minimum distance A wireless network can achieve maximum throughput without each node meeting all others Optimal linear decentralized estimation in a bandwidth constrained sensor network Near BER optimal partial response codes Bounds on mutual information rates of noisy channels with timing errors
×
引用
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