Multiple-input Multiple-output Antenna Selection Research Articles

MIMO antenna selection using biogeography‐based optimization with nonlinear migration models

SummaryThis papers deals with the problem of antenna selection (AS) for a multiple‐input multiple‐output (MIMO) wireless system under the constraint of the channel capacity maximization. The biogeography‐based optimization (BBO) algorithm is applied on the joint transmitter and receiver AS problem. Moreover, the performance of different BBO migration models is compared with a real valued genetic algorithm (RVGA) as well as with the ant colony optimization (ACO). Representative simulation scenarios are provided in detail, involving selection of 2 × 4,3 × 5,4 × 6,8 × 8 antennas in a 16 × 16 MIMO system. The numerical results demonstrate the efficiency and the applicability of the BBO algorithm in modern MIMO wireless systems.

Massive MIMO Antenna Selection: Switching Architectures, Capacity Bounds, and Optimal Antenna Selection Algorithms

Antenna selection is a multiple-input multiple-output (MIMO) technology, which uses radio frequency (RF) switches to select a good subset of antennas. Antenna selection can alleviate the requirement on the number of RF transceivers, thus being attractive for massive MIMO systems. In massive MIMO antenna selection systems, RF switching architectures need to be carefully considered. In this paper, we examine two switching architectures, i.e., full-array and sub-array. By assuming independent and identically distributed Rayleigh flat fading channels, we use asymptotic theory on order statistics to derive the asymptotic upper capacity bounds of massive MIMO channels with antenna selection for the both switching architectures in the large-scale limit. We also use the derived bounds to further derive the upper bounds of the ergodic achievable spectral efficiency considering the channel state information (CSI) acquisition. It is also showed that the ergodic capacity of sub-array antenna selection system scales no faster than double logarithmic rate. In addition, optimal antenna selection algorithms based on branch-and-bound are proposed for both switching architectures. Our results show that the derived asymptotic bounds are effective and also apply to the finite-dimensional MIMO. The CSI acquisition is one of the main limits for the massive MIMO antenna selection systems in the time-variant channels. The proposed optimal antenna selection algorithms are much faster than the exhaustive-search-based antenna selection, e.g., 1000 × speedup observed in the large-scale system. Interestingly, the full-array and sub-array systems have very close performance, which is validated by their exact capacities and their close upper bounds on capacity.

Low-Complexity Transmit Antenna Selection and Beamforming for Large-Scale MIMO Communications

Transmit antenna selection plays an important role in large-scale multiple-input multiple-output (MIMO) communications, but optimal large-scale MIMO antenna selection is a technical challenge. Exhaustive search is often employed in antenna selection, but it cannot be efficiently implemented in large-scale MIMO communication systems due to its prohibitive high computation complexity. This paper proposes a low-complexity interactive multiple-parameter optimization method for joint transmit antenna selection and beamforming in large-scale MIMO communication systems. The objective is to jointly maximize the channel outrage capacity and signal-to-noise (SNR) performance and minimize the mean square error in transmit antenna selection and minimum variance distortionless response (MVDR) beamforming without exhaustive search. The effectiveness of all the proposed methods is verified by extensive simulation results. It is shown that the required antenna selection processing time of the proposed method does not increase along with the increase of selected antennas, but the computation complexity of conventional exhaustive search method will significantly increase when large-scale antennas are employed in the system. This is particularly useful in antenna selection for large-scale MIMO communication systems.

On the marginal distribution of the eigenvalues of wishart matrices

Random matrices play a crucial role in the design and analysis of multiple-input multiple-output (MIMO) systems. In particular, performance of MIMO systems depends on the statistical properties of a subclass of random matrices known as Wishart when the propagation environment is characterized by Rayleigh or Rician fading. This paper focuses on the stochastic analysis of this class of matrices and proposes a general methodology to evaluate some multiple nested integrals of interest. With this methodology we obtain a closed-form expression for the joint probability density function of k consecutive ordered eigenvalues and, as a special case, the PDF of the lscrth ordered eigenvalue of Wishart matrices. The distribution of the largest eigenvalue can be used to analyze the performance of MIMO maximal ratio combining systems. The PDF of the smallest eigenvalue can be used for MIMO antenna selection techniques. Finally, the PDF the kth largest eigenvalue finds applications in the performance analysis of MIMO singular value decomposition systems.

Adaptive MIMO antenna selection via discrete stochastic optimization

Recently it has been shown that it is possible to improve the performance of multiple-input multiple-output (MIMO) systems by employing a larger number of antennas than actually used and selecting the optimal subset based on the channel state information. Existing antenna selection algorithms assume perfect channel knowledge and optimize criteria such as Shannon capacity or various bounds on error rate. This paper examines MIMO antenna selection algorithms where the set of possible solutions is large and only a noisy estimate of the channel is available. In the same spirit as traditional adaptive filtering algorithms, we propose simulation based discrete stochastic optimization algorithms to adaptively select a better antenna subset using criteria such as maximum mutual information, bounds on error rate, etc. These discrete stochastic approximation algorithms are ideally suited to minimize the error rate since computing a closed form expression for the error rate is intractable. We also consider scenarios of time-varying channels for which the antenna selection algorithms can track the time-varying optimal antenna configuration. We present several numerical examples to show the fast convergence of these algorithms under various performance criteria, and also demonstrate their tracking capabilities.