具有部分信道信息的分组MC-CDMA系统可行资源分配

Yachen Wang, G. Xie, Yuan'an Liu, Na Li
{"title":"具有部分信道信息的分组MC-CDMA系统可行资源分配","authors":"Yachen Wang, G. Xie, Yuan'an Liu, Na Li","doi":"10.1109/ISCIT.2007.4392104","DOIUrl":null,"url":null,"abstract":"This paper puts forward two novel user-grouping algorithms for grouped MC-CDMA systems. The adaptive assignment for user-grouping plays an important role for link quality. We formulate the capacity-maximizing problem of user-grouping and analysis the optimal criterion for it. The derived optimal criterion has a similar form with signal to noise plus interference (SINR), with unassigned power included. Thus the unassigned power leads to an unpractical usage. We then investigate user's equivalent SINR for minimum mean square error (MMSE) detection serving as assignment criterion, and propose two kinds of user-grouping algorithms. In these algorithms, only partial channel information is needed at the base station, which saves a large part of bandwidth occupying by feedback information. The proposed algorithms are evaluated by computer simulations to be prior to the conventional algorithm at both BER performance and data rate. Meanwhile, they have a lower implementation complexity for practical reality.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"203 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Feasible resource allocation with partial channel information for grouped MC-CDMA systems\",\"authors\":\"Yachen Wang, G. Xie, Yuan'an Liu, Na Li\",\"doi\":\"10.1109/ISCIT.2007.4392104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper puts forward two novel user-grouping algorithms for grouped MC-CDMA systems. The adaptive assignment for user-grouping plays an important role for link quality. We formulate the capacity-maximizing problem of user-grouping and analysis the optimal criterion for it. The derived optimal criterion has a similar form with signal to noise plus interference (SINR), with unassigned power included. Thus the unassigned power leads to an unpractical usage. We then investigate user's equivalent SINR for minimum mean square error (MMSE) detection serving as assignment criterion, and propose two kinds of user-grouping algorithms. In these algorithms, only partial channel information is needed at the base station, which saves a large part of bandwidth occupying by feedback information. The proposed algorithms are evaluated by computer simulations to be prior to the conventional algorithm at both BER performance and data rate. Meanwhile, they have a lower implementation complexity for practical reality.\",\"PeriodicalId\":331439,\"journal\":{\"name\":\"2007 International Symposium on Communications and Information Technologies\",\"volume\":\"203 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Communications and Information Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2007.4392104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Communications and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2007.4392104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

针对分组MC-CDMA系统,提出了两种新的用户分组算法。用户分组的自适应分配对链路质量起着重要的作用。提出了用户分组的容量最大化问题,并分析了该问题的最优准则。所导出的最优准则与信噪加干扰(SINR)的形式相似,其中包括未分配功率。因此,未分配的权力导致了不实际的使用。然后研究了用户等效信噪比作为最小均方误差(MMSE)检测的分配准则,并提出了两种用户分组算法。在这些算法中,基站只需要部分信道信息,从而节省了反馈信息占用的大量带宽。计算机仿真结果表明,该算法在误码率和数据速率方面都优于传统算法。同时,在实际应用中具有较低的实现复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Feasible resource allocation with partial channel information for grouped MC-CDMA systems
This paper puts forward two novel user-grouping algorithms for grouped MC-CDMA systems. The adaptive assignment for user-grouping plays an important role for link quality. We formulate the capacity-maximizing problem of user-grouping and analysis the optimal criterion for it. The derived optimal criterion has a similar form with signal to noise plus interference (SINR), with unassigned power included. Thus the unassigned power leads to an unpractical usage. We then investigate user's equivalent SINR for minimum mean square error (MMSE) detection serving as assignment criterion, and propose two kinds of user-grouping algorithms. In these algorithms, only partial channel information is needed at the base station, which saves a large part of bandwidth occupying by feedback information. The proposed algorithms are evaluated by computer simulations to be prior to the conventional algorithm at both BER performance and data rate. Meanwhile, they have a lower implementation complexity for practical reality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An improved quantization scheme for lattice-reduction aided MIMO detection PAPR reduction in the OFDM system employing Tone Reservation based on FFT/IFFT Implementation and analysis of configurable Real Time Address Trace Compressor for embedded microprocessors Measured improvement of indoor coverage for fixed wireless loops with multiple antenna receivers Real-time wideband MIMO demonstrator
×
引用
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