Cart (Loading....) | Create Account
Close category search window
 

Decremental User Selection for Large-Scale Multi-User MIMO Downlink with Zero-Forcing Beamforming

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)
Shengchun Huang ; Sch. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha, China ; Hao Yin ; Haoming Li ; Leung, V.C.M.

This paper proposes a decremental user selection algorithm based on zero-forcing beamforming when the number of users K in the network is smaller than the number of antennas M at a base station. The algorithm is specifically designed for large-scale multi-user multiple-input multiple-output (MIMO) downlink channels. While previous user selection algorithms are based on incremental search that starts from an empty user set, our proposed delete the minimum lambda (DML) algorithm starts by selecting all users and then deleting one user per iteration. DML substantially reduces the computational complexity as the cardinality of the final user set is close to K. Simulation results indicate that on average DML achieves an equal or higher sum rate performance than previous algorithms with greatly reduced complexity of O(MK2).

Published in:

Wireless Communications Letters, IEEE  (Volume:1 ,  Issue: 5 )

Date of Publication:

October 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.