Abstract: MIMO systems with multiple antennas can cause a high cost and complexity. Focusing on this problem, a fast joint transmit-receive antenna selection algorithm is presented. The proposed algorithm uses the Gerschgorin circle theorem to estimate the eigen-values, and choose the row and column whose lower bound of the minimum eigen-value is the max by searching for the matrix row by row and column by column, so the minimum eigen-value of matrix declines to the least. Theoretical analysis and simulation results show that the capacity of the proposed algorithm is close to that of the optimal exhaustive search algorithm with low complexity in the case where the number of RF chains is small.

Key words: MIMO, Joint antenna selection, Gerschgorin circle