交错局域FDMA的能量最小化性能研究

Lei You, Lei Lei, D. Yuan
{"title":"交错局域FDMA的能量最小化性能研究","authors":"Lei You, Lei Lei, D. Yuan","doi":"10.1109/CAMAD.2014.7033197","DOIUrl":null,"url":null,"abstract":"Optimal channel allocation is a key performance engineering aspect in single-carrier frequency-division multiple access (SC-FDMA). It is of significance to consider minimum sum power (Min-Power), subject to meeting specified user's demand, since mobile users typically employ battery-powered handsets. In this paper, we prove that Min-Power is polynomial-time solvable for interleaved SC-FDMA (IFDMA). Then we propose a channel allocation algorithm for IFDMA, which is guaranteed to achieve global optimum in polynomial time. We numerically compare the proposed algorithm with optimal localized SC-FDMA (LFDMA) for Min-Power. The results show that LFDMA outperforms IFDMA in the maximal supported user demand. When the user demand can be satisfied in both LFDMA and IFDMA, LFDMA performs slightly better than IFDMA. However Min-Power is polynomial-time solvable for IFDMA whereas it is not for LFDMA.","PeriodicalId":111472,"journal":{"name":"2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A performance study of energy minimization for interleaved and localized FDMA\",\"authors\":\"Lei You, Lei Lei, D. Yuan\",\"doi\":\"10.1109/CAMAD.2014.7033197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal channel allocation is a key performance engineering aspect in single-carrier frequency-division multiple access (SC-FDMA). It is of significance to consider minimum sum power (Min-Power), subject to meeting specified user's demand, since mobile users typically employ battery-powered handsets. In this paper, we prove that Min-Power is polynomial-time solvable for interleaved SC-FDMA (IFDMA). Then we propose a channel allocation algorithm for IFDMA, which is guaranteed to achieve global optimum in polynomial time. We numerically compare the proposed algorithm with optimal localized SC-FDMA (LFDMA) for Min-Power. The results show that LFDMA outperforms IFDMA in the maximal supported user demand. When the user demand can be satisfied in both LFDMA and IFDMA, LFDMA performs slightly better than IFDMA. However Min-Power is polynomial-time solvable for IFDMA whereas it is not for LFDMA.\",\"PeriodicalId\":111472,\"journal\":{\"name\":\"2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAMAD.2014.7033197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMAD.2014.7033197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

信道优化分配是单载波频分多址(SC-FDMA)中关键的性能工程问题。由于移动用户通常使用电池供电的手机,因此在满足特定用户需求的前提下,考虑最小和功率(Min-Power)是有意义的。本文证明了交错SC-FDMA (IFDMA)的最小功率是多项式时间可解的。在此基础上,提出了一种保证在多项式时间内实现全局最优的IFDMA信道分配算法。我们将该算法与最优局部SC-FDMA (LFDMA)的最小功率进行了数值比较。结果表明,在支持的最大用户需求方面,LFDMA优于IFDMA。当LFDMA和IFDMA都能满足用户需求时,LFDMA的性能略好于IFDMA。然而,最小功耗对于IFDMA是多项式时间可解的,而对于LFDMA则不是。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A performance study of energy minimization for interleaved and localized FDMA
Optimal channel allocation is a key performance engineering aspect in single-carrier frequency-division multiple access (SC-FDMA). It is of significance to consider minimum sum power (Min-Power), subject to meeting specified user's demand, since mobile users typically employ battery-powered handsets. In this paper, we prove that Min-Power is polynomial-time solvable for interleaved SC-FDMA (IFDMA). Then we propose a channel allocation algorithm for IFDMA, which is guaranteed to achieve global optimum in polynomial time. We numerically compare the proposed algorithm with optimal localized SC-FDMA (LFDMA) for Min-Power. The results show that LFDMA outperforms IFDMA in the maximal supported user demand. When the user demand can be satisfied in both LFDMA and IFDMA, LFDMA performs slightly better than IFDMA. However Min-Power is polynomial-time solvable for IFDMA whereas it is not for LFDMA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信