Delay analysis for Fair Power Allocation Strategy in multi antenna broadcast channels

Alireza Borhani, S. Akhlaghi
{"title":"Delay analysis for Fair Power Allocation Strategy in multi antenna broadcast channels","authors":"Alireza Borhani, S. Akhlaghi","doi":"10.1109/ISABEL.2010.5702788","DOIUrl":null,"url":null,"abstract":"This paper concerns delay analysis for Fair Power Allocation Strategy (FPAS) in multi antenna Broadcast Channel (BC). It is assumed the transmitter aims at sending individual information to a large number of single-antenna users (n) through a common wireless channel. Assuming there is a total transmit power constraint, the FPAS attempts to select the maximum number of active users in which each can receive the minimum rate constraint of Rmin. Noting this and assuming the system delay is defined as the minimum number of channel uses such that each user with probability approaching one is selected at least once, we show that for the case of single-antenna BC, the expected delay of FPAS scales as Rmin n logn/loglogn + ω(n/loglogn). Then, using our earlier proposed FPAS for multi-antenna BC, it is shown the expected delay of this strategy behaves like Rmin n logn/M loglogn−θ(1) + ω(n/loglogn), where M denotes the number of transmit antennas. Moreover, it is shown for sufficiently large (k) number of channel uses, the average number of services received by a randomly selected user for single-antenna and multi-antenna BC scale as k loglogn/nRmin (1+O(√logk/k)) and kM loglogn/nRmin (1+O(√logk/k)), respectively.","PeriodicalId":165367,"journal":{"name":"2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISABEL.2010.5702788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper concerns delay analysis for Fair Power Allocation Strategy (FPAS) in multi antenna Broadcast Channel (BC). It is assumed the transmitter aims at sending individual information to a large number of single-antenna users (n) through a common wireless channel. Assuming there is a total transmit power constraint, the FPAS attempts to select the maximum number of active users in which each can receive the minimum rate constraint of Rmin. Noting this and assuming the system delay is defined as the minimum number of channel uses such that each user with probability approaching one is selected at least once, we show that for the case of single-antenna BC, the expected delay of FPAS scales as Rmin n logn/loglogn + ω(n/loglogn). Then, using our earlier proposed FPAS for multi-antenna BC, it is shown the expected delay of this strategy behaves like Rmin n logn/M loglogn−θ(1) + ω(n/loglogn), where M denotes the number of transmit antennas. Moreover, it is shown for sufficiently large (k) number of channel uses, the average number of services received by a randomly selected user for single-antenna and multi-antenna BC scale as k loglogn/nRmin (1+O(√logk/k)) and kM loglogn/nRmin (1+O(√logk/k)), respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多天线广播信道中公平功率分配策略的延迟分析
研究了多天线广播信道中公平功率分配策略(FPAS)的时延分析。假设发射机旨在通过公共无线信道向大量单天线用户(n)发送单个信息。假设存在总发射功率约束,FPAS尝试选择活动用户的最大数量,其中每个用户都可以接收最小速率约束Rmin。注意到这一点,并假设系统延迟被定义为信道使用的最小数量,使得每个概率接近1的用户至少被选择一次,我们表明,对于单天线BC的情况,FPAS的预期延迟规模为Rmin n logn/loglog + ω(n/loglog)。然后,使用我们之前提出的多天线BC的FPAS,表明该策略的预期延迟表现为Rmin n logn/M loglogn−θ(1) + ω(n/loglogn),其中M表示发射天线的数量。此外,对于足够大的(k)信道使用数量,随机选择的用户接收单天线和多天线BC的平均业务量分别为k loglogn/nRmin (1+O(√logk/k))和kM loglogn/nRmin (1+O(√logk/k))。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Generalized quantum Turing machine and its use to find an algorithm solving NP-Complete problem Quantifying the performance of compressive sensing on scalp EEG signals Cognitive radio equipments supporting spectrum agility Bio-inspired cognitive phones based on human nervous system Power efficient wireless connectivity of a wearable data glove
×
引用
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