Maximum-SNR transmit antenna selection with two receive antennas is polynomially solvable

Abstract

The recent increased interest in massive multiple-input multiple output systems, combined with the cost of the analog RF chains, necessitates the use of efficient antenna selection (AS) schemes. Capacity or SNR optimal AS has been considered to require an exhaustive search among all possible antenna subsets. In this work, we prove that the maximum-SNR transmit AS problem with two receive antennas is polynomially solvable and develop an algorithm that solves it with quartic complexity, independently of the number of selected antennas. Our method also applies to receive AS with two transmit antennas.

Efficient Low-Complexity Antenna Selection Algorithms in Multi-User Massive MIMO Systems With Matched Filter Precoding

“…However, their work focused on maximizing the sum rate capacity, which can be obtained via high complexity dirty paper coding. Moreover, the authors in [16] and [17] designed an AS algorithm with quartic complexity in pointto-point M-MIMO systems, while the authors in [18] studied the trade-off between energy and spectral efficiencies under random AS in Multi-User (MU) M-MIMO downlink systems. Moreover, in [19], the authors proposed an AS scheme under interference alignment, where the interference is forced to zero through transmitter-receiver beamforming.…”