多用户MIMO系统矢量摄动算法的复杂度降低技术

Muneaki Matsuo, R. Imashioya, Y. Nagao, M. Kurosaki, H. Ochi
{"title":"多用户MIMO系统矢量摄动算法的复杂度降低技术","authors":"Muneaki Matsuo, R. Imashioya, Y. Nagao, M. Kurosaki, H. Ochi","doi":"10.1109/ISCIT.2011.6089700","DOIUrl":null,"url":null,"abstract":"Recently Multi User MIMO has been becoming an interesting topic in wireless communication system. Vector Perturbation can achieve near capacity, but it has high complexity which makes it is difficult to be implemented in the hardware. In this paper we propose an algorithm to reduce the complexity of the Vector Perturbation with negligible decrease in performance.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complexity reduction technique of Vector Perturbation algorithm for multiuser MIMO systems\",\"authors\":\"Muneaki Matsuo, R. Imashioya, Y. Nagao, M. Kurosaki, H. Ochi\",\"doi\":\"10.1109/ISCIT.2011.6089700\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently Multi User MIMO has been becoming an interesting topic in wireless communication system. Vector Perturbation can achieve near capacity, but it has high complexity which makes it is difficult to be implemented in the hardware. In this paper we propose an algorithm to reduce the complexity of the Vector Perturbation with negligible decrease in performance.\",\"PeriodicalId\":226552,\"journal\":{\"name\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2011.6089700\",\"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 11th International Symposium on Communications & Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2011.6089700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,多用户MIMO已成为无线通信领域的研究热点。矢量摄动可以达到接近容量的目的,但其复杂性高,难以在硬件上实现。在本文中,我们提出了一种算法来降低矢量摄动的复杂性,而性能的降低可以忽略不计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Complexity reduction technique of Vector Perturbation algorithm for multiuser MIMO systems
Recently Multi User MIMO has been becoming an interesting topic in wireless communication system. Vector Perturbation can achieve near capacity, but it has high complexity which makes it is difficult to be implemented in the hardware. In this paper we propose an algorithm to reduce the complexity of the Vector Perturbation with negligible decrease in performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Opportunistic routing in multi-channel cognitive radio networks Improved roughening algorithm and hardware implementation for particle filter applied to bearings-only tracking A design of smart radio research platform for universal access in a multi-RAT environment Distributed anomaly event detection in wireless networks using compressed sensing Constructing (k, r)-connected dominating sets for robust backbone in wireless sensor networks
×
引用
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