Multi-stream iterative SVD for massive MIMO communication systems under time varying channels

Singular value decomposition (SVD) plays an important role in signal processing for multi-input multi-output (MIMO) communication systems. Under massive MIMO scenarios, as the channel matrix is very large, implementing SVD at every frame is highly inefficient. Existing literature on iterative SVD algorithms are mostly heuristic based, and the associated tracking performance under time-varying channels is not clear. The difficulties of deriving and analyzing SVD algorithms are due to the non-convexity of the associated optimization problem and the time-varying nature of the MIMO channel. In this paper, we formulate the problem on Grassmann manifolds and derive a multi-stream iterative SVD algorithm using optimization techniques. To enhance the tracking performance under time-varying channels, we propose a compensation algorithm to offset the motion of the time-varying target eigenspace. We analyze the convergence behavior of the proposed algorithm, where we show that under some mild conditions, the proposed iterative SVD algorithm with compensations has zero tracking error, despite the underlying problem being non-convex and the channel being time-varying. The complexity of the algorithm is only O(n2p) for estimating p singular vectors, compared with O(n3) for the SVD of a n × n channel matrix.

[1]  Loring W. Tu,et al.  An introduction to manifolds , 2007 .

[2]  Robert W. Heath,et al.  MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks , 2008, IEEE Transactions on Signal Processing.

[3]  Babak Daneshrad,et al.  Energy-Efficient Power Loading for a MIMO-SVD System and Its Performance in Flat Fading , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[4]  G. Stewart.  Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices , 1976 .

[5]  Martin Haardt,et al.  Low-complexity lattice reduction-aided channel inversion methods for large multi-User MIMO systems , 2012, 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[6]  Ying Tan,et al.  MIMO transmission over a time-varying channel using SVD , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[8]  Martin Haardt,et al.  Low-Complexity Lattice Reduction-Aided Channel Inversion Methods for Large-Dimensional Multi-User MIMO Systems , 2013, ArXiv.

[9]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[10]  Ali Abdi,et al.  A space-time correlation model for multielement antenna systems in mobile fading channels , 2002, IEEE J. Sel. Areas Commun..

[11]  Björn E. Ottersten,et al.  Asymptotic eigenvalue distributions and capacity for MIMO channels under correlated fading , 2004, IEEE Transactions on Wireless Communications.

[12]  Bin Yang,et al.  Projection approximation subspace tracking , 1995, IEEE Trans. Signal Process..

[13]  Thomas Kailath,et al.  Fast subspace decomposition , 1994, IEEE Trans. Signal Process..

[14]  Youngchul Sung,et al.  A new approach to beamformer design for massive MIMO systems based on k-Regularity , 2012, 2012 IEEE Globecom Workshops.

[15]  Kareem E. Baddour,et al.  Autoregressive models for fading channel simulation , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[16]  C. Udriste,et al.  Convex Functions and Optimization Methods on Riemannian Manifolds , 1994 .

[17]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[18]  Donald W. Tufts,et al.  Simple, effective computation of principal eigenvectors and their eigenvalues and application to high-resolution estimation of frequencies , 1986, IEEE Trans. Acoust. Speech Signal Process..

[19]  Robert W. Brodersen,et al.  An adaptive multiantenna transceiver for slowly flat fading channels , 2003, IEEE Trans. Commun..

[20]  Hiroshi Murase,et al.  Partial eigenvalue decomposition for large image sets using run-length encoding , 1995, Pattern Recognit..

[21]  Vincent K. N. Lau,et al.  Convergence analysis of mixed timescale cross-layer stochastic optimization , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[22]  Mansoor Shafi,et al.  An Extended One-Ring MIMO Channel Model , 2007, IEEE Transactions on Wireless Communications.

[23]  Ross D. Murch,et al.  A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach , 2004, IEEE Transactions on Wireless Communications.

[24]  Eva Lundstr.  Adaptive Eigenvalue Computations Using Newton's Method on the Grassmann Manifold , 1999 .

[25]  G. Golub,et al.  Tracking a few extreme singular values and vectors in signal processing , 1990, Proc. IEEE.

[26]  Jun Tong,et al.  Design and Analysis of Large MIMO Systems With Krylov Subspace Receivers , 2012, IEEE Transactions on Signal Processing.

[27]  Levent Tunçel,et al.  Optimization algorithms on matrix manifolds , 2009, Math. Comput..

[28]  Pierre-Antoine Absil,et al.  Continuous-time flows on quotient spaces for principal component analysis , 2004 .

[29]  Klaus-Jürgen Bathe,et al.  The subspace iteration method - Revisited , 2013 .