Fast antenna selection algorithms for MIMO systems

We consider the capacity of multiple-input-multiple-output (MIMO) systems with reduced complexity. One link end uses all available antennas, while the other chooses the "best" L out of N antennas. The selection of the optimum antenna subset requires an exhaustive search of all possible combinations, involving (/sub L//sup N/) computations of determinants of size L /spl times/ L, which can become prohibitively complex. In this paper, we suggest a class of fast antenna selection algorithm that are based on the correlation or mutual information between the signals at the different antenna elements. It requires less than N/sup 2/ vector multiplications and thus leads to dramatic savings on the computation time. Its performance is very close to the optimum selection procedure: the capacity penalty is less than l bit/s/Hz for the analyzed examples. The algorithm thus offers the possibility of almost-optimum selection even in fast-changing environments