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

Opportunistic beamforming based on multiple weighting vectors

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)
Il-Min Kim ; Dept. Electr. & Comput. Eng., Queen''s Univ., Kingston, Ont., Canada ; Seung-Chul Hong ; Ghassemzadeh, S.S. ; Tarokh, Vahid

In order to improve the throughput of the opportunistic beamforming, the authors generalize the opportunistic beamforming by using multiple random weighting vectors at each time slot. The base station chooses the best weighting vector and performs the opportunistic beamforming with this optimum vector. For the case of equally strong independent fast Rayleigh fading channels, the throughput of the proposed scheme is analytically approximated and the optimum number of random weighting vectors per time slot is obtained. Numerical results demonstrate that the proposed scheme considerably improves the throughput compared to the conventional opportunistic beamforming for a low/realistic number of users.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:4 ,  Issue: 6 )

Date of Publication:

Nov. 2005

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.