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

Optimal Beam Subset and User Selection for Orthogonal Random 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

2 Author(s)
Tae-sung Kang ; Sch. of EECS, KAIST, Daejeon ; Hyung-Myung Kim

The throughput performance of orthogonal random beamforming (ORBF) with a finite number of users is limited due to the increasing amount of residual interference. In this letter, we find the optimal beam subset, the optimal user set, and the optimal number of random beams to maximize the sum throughput of the ORBF. The proposed scheme provides the best trade-off between the multiplexing gain and the multiuser interference by the determination of the optimal number of random beams as well as the beam selection diversity gain due to the selection of the optimal beam subset. In addition, two efficient suboptimal schemes are presented to reduce the computational complexity and the feedback overhead of the optimal method.

Published in:

Communications Letters, IEEE  (Volume:12 ,  Issue: 9 )

Date of Publication:

September 2008

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.