优化功率和速率分配的编码V-BLAST性能分析

V. Kostina, S. Loyka
{"title":"优化功率和速率分配的编码V-BLAST性能分析","authors":"V. Kostina, S. Loyka","doi":"10.1109/ISIT.2011.6033871","DOIUrl":null,"url":null,"abstract":"Several optimization strategies for instantaneous rate and/or power allocation in the coded V-BLAST are studied analytically. Outage probabilities and system capacities of these strategies in a spatial multiplexing system are compared under generic settings. Since the conventional waterfilling algorithm is suboptimal for the coded V-BLAST, a recently-proposed “fractional waterfilling” algorithm is studied, which simultaneously maximizes the system capacity and minimizes the outage probability. A comparative, closed-form performance analysis of this and other algorithms is presented, including bounds on the outage probability and its low-outage approximations. The fractional waterfilling algorithm attains the full MIMO channel diversity and outperforms the other algorithms by a wide margin.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":" 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance analysis of coded V-BLAST with optimum power and rate allocation\",\"authors\":\"V. Kostina, S. Loyka\",\"doi\":\"10.1109/ISIT.2011.6033871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several optimization strategies for instantaneous rate and/or power allocation in the coded V-BLAST are studied analytically. Outage probabilities and system capacities of these strategies in a spatial multiplexing system are compared under generic settings. Since the conventional waterfilling algorithm is suboptimal for the coded V-BLAST, a recently-proposed “fractional waterfilling” algorithm is studied, which simultaneously maximizes the system capacity and minimizes the outage probability. A comparative, closed-form performance analysis of this and other algorithms is presented, including bounds on the outage probability and its low-outage approximations. The fractional waterfilling algorithm attains the full MIMO channel diversity and outperforms the other algorithms by a wide margin.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\" 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6033871\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6033871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

对编码V-BLAST中瞬时速率和/或功率分配的几种优化策略进行了分析研究。在一般情况下,比较了这些策略在空间复用系统中的中断概率和系统容量。针对传统充水算法对编码V-BLAST的次优性,本文研究了一种同时实现系统容量最大化和停机概率最小化的“分段充水”算法。对该算法和其他算法的性能进行了比较、封闭的分析,包括中断概率的界限及其低中断近似。分式充水算法实现了完全的MIMO信道分集,并且在很大程度上优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance analysis of coded V-BLAST with optimum power and rate allocation
Several optimization strategies for instantaneous rate and/or power allocation in the coded V-BLAST are studied analytically. Outage probabilities and system capacities of these strategies in a spatial multiplexing system are compared under generic settings. Since the conventional waterfilling algorithm is suboptimal for the coded V-BLAST, a recently-proposed “fractional waterfilling” algorithm is studied, which simultaneously maximizes the system capacity and minimizes the outage probability. A comparative, closed-form performance analysis of this and other algorithms is presented, including bounds on the outage probability and its low-outage approximations. The fractional waterfilling algorithm attains the full MIMO channel diversity and outperforms the other algorithms by a wide margin.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信