Principal Component Tracking for Massive MIMO Channels in High Mobility Scenarios With Diagonal Step Size Matrix

The present article proposes a novel adaptive algorithm with an optimal diagonal step size matrix for multi-dimensional channel principal component tracking in two dimensional massive multiple-input and multiple-output (M-MIMO) systems. First, we prove that the weighted subspace algorithm globally converges to the stationary stochastic process' major eigenvectors. Then, using the maximum likelihood criterion, we optimize the weight coefficient matrix and derive the convergent condition for the step size range in order to maintain the algorithm stability. To accelerate the convergence, we initially suggest the diagonal step size matrix for multi-dimensional eigenvector tracking. Simultaneously, an optimal diagonal step size matrix is derived, which not only accelerates the convergence speed distinctively but also improves the tracking of multi-dimensional eigenvectors. Moreover, the transient behavior during the adaptation process is investigated in a straight-forward way and the relationship between the convergence time constant and the eigenvalues of the received signals is uncovered. Finally, simulations reveal that the proposed approach outperforms established algorithms such as Oja's, Delmas and gradient descent algorithms. This approach establishes a sound foundation for tracking channel state information in M-MIMO systems with great mobility.

Automated summary

This article proposes a novel adaptive algorithm with an optimal diagonal step size matrix for multi-dimensional channel principal component tracking. The algorithm not only accelerates the convergence speed distinctively but also improves the tracking of multi-dimensional eigenvectors.