By Topic

Multimode Transmission for Multiuser MIMO Systems With Block Diagonalization

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

4 Author(s)
Runhua Chen ; DSPS R&D Center, Texas Instrum. Inc., Dallas, TX ; Zukang Shen ; Andrews, J.G. ; Heath, R.W.

A low-complexity multimode transmission technique for downlink multiuser multiple-input-multiple-output (MIMO) systems with block diagonalization (BD) is proposed. The proposed technique adaptively configures the number of data streams for each user by adjusting its number of active receive antenna and switching between single-stream beamforming and multistream spatial multiplexing, as a means to exploit the multimode switching diversity. We consider a highly loaded system where there are a large number of users, hence a subset of users need to be selected. Joint user and antenna selection has been proposed as a multiuser multimode switching technique, where the optimal subset of receive antennas and users are chosen to maximize the sum throughput. The brute-force search, however, is prohibitively complicated. In this paper, two low-complexity near-optimal user/antenna selection algorithms are developed. The first algorithm aims at maximizing a capacity lower bound, derived in terms of the sum Frobenius norm of the channel, while the second algorithm greedily maximizes the sum capacity. We analytically evaluate the complexity of the proposed algorithms and show that it is orders of magnitude lower than that of the exhaustive search. Simulation results demonstrate that the proposed algorithms achieve up to 98% of the sum throughput of the exhaustive search, for most system configurations, while the complexity is substantially reduced.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 7 )