By Topic

Rate-Invariant User Preselection for Complexity Reduction in Multiuser MIMO Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Guthy, C. ; Associate Inst. for Signal Process., Tech. Univ. Munchen, Munich ; Utschick, W. ; Nossek, J.A. ; Dietl, G.
more authors

Finding the matrix with the maximum singular value amongst a set of matrices is a common problem occurring in transmit signal processing algorithms for multiuser multiple-input multiple-output (MIMO) systems. However, computing the principal singular value of a matrix is a rather numerically complex task. Furthermore, in many practical scenarios, the number of users is large and for each user this task has to be conducted. In this paper we therefore propose a novel user preselection method which reduces the computational complexity at no performance loss. This is achieved by deselecting some users based on a simple criterion and thus avoiding explicit computations of the singular values of those users. This criterion is based on easily computable bounds for the principal singular values. Finally, a statistical analysis is provided and the application to the Successive Encoding Successive Allocation Method (SESAM) is shown.

Published in:

Vehicular Technology Conference, 2008. VTC 2008-Fall. IEEE 68th

Date of Conference:

21-24 Sept. 2008