大规模MIMO系统中的双向搜索天线选择算法

Bidirectional search antenna selection algorithm in Massive MIMO system

大规模MIMO(Massive MIMO)拥有众多天线,如果按照传统的方式配备等量的射频链路,势必会大幅度增加硬件成本及系统复杂度.天线选择技术能够在不损害多天线系统优势的前提下,使射频链路成本明显下降.天线选择的主要方法其思想是在全部天线中选出部分天线传输数据,从而使射频链路成本不再成为限制因素,在实际的无线信道中,信道状态变化多样,为了达到所需性能指标,通信系统需要选择不同数目的天线进行数据传输,而现有的天线选择算法往往只适用于固定天线数的场景.本文针对多变的信道状态,基于递增选择算法与递减选择算法提出了双向搜索天线选择算法,能够灵活应对不同的天线数需求,并且保持了较低的计算复杂度.

Massive multiple-input multiple-output （Massive MIMO） has a large number of anten- nas, so the hardware cost and system complexity will increase significantly if equal RF chains are installed in the conventional way.Antenna selection technology can effectively reduce the cost of RF chains without impairing the advantages of multi-antenna systems which is to choose partial antennas to transmit or receive data from all the antennas, so the MIMO communication system is no longer completely limited by RF cost. For a practical wireless channel, channel states are variable. In order to achieve the required performance, communication systems need to select a different number of antennas for data transmission, however, the present antenna selection algo- rithms are typically suitable for a fixed number of antennas.In this paper, we propose a bidirec- tional search antenna selection algorithm based on incremental and decremental antenna selection algorithms for variable channel states, which can flexibly meet the demand for the different num- ber of antennas and maintain a lower computational complexity.