On optimal detection ordering for coded V-BLAST

Alain U. Toboso, S. Loyka, F. Gagnon
{"title":"On optimal detection ordering for coded V-BLAST","authors":"Alain U. Toboso, S. Loyka, F. Gagnon","doi":"10.1109/cwit.2013.6621587","DOIUrl":null,"url":null,"abstract":"Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cwit.2013.6621587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Optimum ordering strategies for the coded V-BLAST with capacity achieving temporal codes on each stream are analytically studied in this paper, including optimal power and/or rate allocations among data streams. A compact closed-form solution is obtained for the case of two transmit antennas and necessary optimality conditions are found for the general case. The optimal rate allocation is shown to have a major impact (stronger streams are detected last) while the optimal power allocation does not alter the original Foschini ordering (stronger streams are detected first). A sub-optimal ordering is proposed based on the necessary optimality conditions, which performs very close to the optimal one but has much smaller computational complexity. An SNR gain of ordering is introduced and studied. All the results also apply to a multiple-access channel under successive interference cancelation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
编码V-BLAST的最优检测排序
本文分析研究了容量在每个流上实现时间码的编码V-BLAST的最优排序策略,包括数据流之间的最优功率和/或速率分配。得到了双发射天线情况下的紧致闭解,并找到了一般情况下的必要最优性条件。最优的速率分配显示有主要的影响(较强的流被检测到最后),而最优的功率分配不改变原来的Foschini排序(较强的流被检测到第一)。基于必要的最优性条件,提出了一种次最优排序,其性能非常接近最优排序,但计算复杂度要小得多。介绍并研究了一种排序信噪比增益。所有结果也适用于连续干扰消除的多址信道。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the achievability of the degrees of freedom for the three-cell MIMO interfering broadcast channel with minimum spatial dimensions Integrating prior knowledge in time series alignment: Prior Optimized Time Warping An achievability proof for the lossy coding of Markov sources with feed-forward Performance of MIMO adaptive subcarrier QAM intensity modulation in Gamma-Gamma turbulence Binary faster than Nyquist optical transmission via non-uniform power allocation
×
引用
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