.png){kind=icon}
返回
Low-Complexity Recursive Convolutional Precoding for OFDM-Based Large-Scale Antenna Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2016.2549516.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Large-scale antenna ( LSA) has gained a lot of attention recently since it can significantly improve the performance of wireless systems. Similar to multiple-input multiple-output ( MIMO) orthogonal frequency division multiplexing ( OFDM) or MIMO-OFDM, LSA can be also combined with OFDM to deal with frequency selectivity in wireless channels. However, such combination suffers from substantially increased complexity proportional to the number of antennas in LSA systems. For the conventional implementation of LSA-OFDM, the number of inverse fast Fourier transforms ( IFFTs) increases with the antenna number since each antenna requires an IFFT for OFDM modulation. Furthermore, zero-forcing ( ZF) precoding is required in LSA systems to support more users, and the required matrix inversion leads to a huge computational burden. In this paper, we propose a low-complexity recursive convolutional precoding to address the issues above. The traditional ZF precoding can be implemented through the recursive convolutional precoding in the time domain so that only one IFFT is required for each user and the matrix inversion can be also avoided. Simulation results show that the proposed approach can achieve the same performance as that of ZF but with much lower complexity.
Keyword:
Large-scale antenna
massive MIMO
precoding
OFDM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
查看更多内容