Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

27 pages with 6 figures and 2 tables. Accepted for publication in IEEE Trans. Wireless Commu

Scientific paper

This paper considers the multiuser multiple-input multiple-output (MIMO) broadcast channel. We consider the case where the multiple transmit antennas are used to deliver independent data streams to multiple users via vector perturbation. We derive expressions for the sum rate in terms of the average energy of the precoded vector, and use this to derive a high signal-to-noise ratio (SNR) closed-form upper bound, which we show to be tight via simulation. We also propose a modification to vector perturbation where different rates can be allocated to different users. We conclude that for vector perturbation precoding most of the sum rate gains can be achieved by reducing the rate allocation problem to the user selection problem. We then propose a low-complexity user selection algorithm that attempts to maximize the high-SNR sum rate upper bound. Simulations show that the algorithm outperforms other user selection algorithms of similar complexity.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-418281

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.