Antenna Selection Symbol-Level Precoding for Low Complexity Large-Scale Antenna Array Systems

Stavros G. Domouchtsidis, C. Tsinos, S. Chatzinotas, B. Ottersten
{"title":"Antenna Selection Symbol-Level Precoding for Low Complexity Large-Scale Antenna Array Systems","authors":"Stavros G. Domouchtsidis, C. Tsinos, S. Chatzinotas, B. Ottersten","doi":"10.1109/CAMAD.2018.8514977","DOIUrl":null,"url":null,"abstract":"Large-Scale Antenna Array Systems may be used to serve multiple users in the same time-frequency resource block which results to harmful multi-user interference (MUI). In the literature precoding techniques have been proposed as a way to mitigate the induced MUI, by designing the transmitted signals using the knowledge of the Channel State Information (CSI), in block-level precoding (BLP) or both the CSI and the information-bearing symbols, in symbol-level precoding (SLP). However, the proposed SLP techniques require fully digital baseband processing which is infeasible in large-scale antenna array systems because of the high cost and power consumption of radio frequency (RF) components. In order to reduce the number of y-RF chains, we address an Antenna Selection Symbol-Level Precoding (AS-SLP) scheme, which minimizes the MUI by activating only a subset of the available antennas. For this scheme we develop an efficient algorithm, based on Coordinate Descent. Simulations provide an insight on the efficiency of the proposed approach and its improvement with respect to the fully digitally approaches.","PeriodicalId":173858,"journal":{"name":"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMAD.2018.8514977","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Large-Scale Antenna Array Systems may be used to serve multiple users in the same time-frequency resource block which results to harmful multi-user interference (MUI). In the literature precoding techniques have been proposed as a way to mitigate the induced MUI, by designing the transmitted signals using the knowledge of the Channel State Information (CSI), in block-level precoding (BLP) or both the CSI and the information-bearing symbols, in symbol-level precoding (SLP). However, the proposed SLP techniques require fully digital baseband processing which is infeasible in large-scale antenna array systems because of the high cost and power consumption of radio frequency (RF) components. In order to reduce the number of y-RF chains, we address an Antenna Selection Symbol-Level Precoding (AS-SLP) scheme, which minimizes the MUI by activating only a subset of the available antennas. For this scheme we develop an efficient algorithm, based on Coordinate Descent. Simulations provide an insight on the efficiency of the proposed approach and its improvement with respect to the fully digitally approaches.
低复杂度大型天线阵列系统的天线选择符号级预编码
大规模天线阵列系统可能在同一时频资源块中为多个用户服务,从而产生有害的多用户干扰。在文献中,预编码技术已被提出作为一种减轻诱导MUI的方法,通过使用块级预编码(BLP)中的信道状态信息(CSI)或符号级预编码(SLP)中的信道状态信息和承载信息的符号的知识来设计传输信号。然而,所提出的SLP技术需要全数字基带处理,这在大规模天线阵列系统中是不可行的,因为射频(RF)组件的成本和功耗高。为了减少y-RF链的数量,我们提出了天线选择符号级预编码(AS-SLP)方案,该方案通过仅激活可用天线的子集来最小化MUI。对于该方案,我们开发了一种基于坐标下降的高效算法。仿真提供了对所提出方法的效率及其相对于完全数字化方法的改进的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信