Low-Complexity MIMO Precoding for Finite-Alphabet Signals
Low-Complexity MIMO Precoding for Finite-Alphabet Signals
复制标题
DOI：
10.1109/twc.2017.2700308
复制
发表时间：
2016-06
影响因子：
10.4
通讯作者：
Yongpeng Wu;D. W. K. Ng;Chao-Kai Wen;R. Schober;A. Lozano
中科院分区：
文献类型：
--
作者：
Yongpeng Wu;D. W. K. Ng;Chao-Kai Wen;R. Schober;A. Lozano
本文研究了单用户多输入多输出（MIMO）信道，特别是有限字母表信号的预编码器的设计。基于渐近表达的交互信息的信道表现出的视线组件和相当一般的天线相关性，预编码结构，分解成一组平行的子信道对的一般信道提出。然后，设计了一个低复杂度的迭代算法，以最大化所有对的互信息之和。该算法显着降低了现有方法的计算量，只有最小的性能损失。复杂度的节省随着发射天线的数量和信号字母表的基数而增加，使得可以支持现有解决方案无法管理的值。最重要的是，所提出的解决方案不需要在发射机处的瞬时信道状态信息（CSI），而仅需要统计CSI。
This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and, in particular, for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels exhibiting line-of-sight components and rather general antenna correlations, precoding structures that decompose the general channel into a set of parallel subchannel pairs are proposed. Then, a low-complexity iterative algorithm is devised to maximize the sum mutual information of all pairs. The proposed algorithm significantly reduces the computational load of existing approaches with only minimal loss in performance. The complexity savings increase with the number of transmit antennas and with the cardinality of the signal alphabet, making it possible to support values thereof that were unmanageable with existing solutions. Most importantly, the proposed solution does not require instantaneous channel state information (CSI) at the transmitter, but only statistical CSI.