Lower Bounds Optimization for Coordinated Linear Transmission Beamformer Design in Multicell Network Downlink

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider the coordinated downlink beamforming problem in a cellular network with the base stations (BSs) equipped with multiple antennas, and with each user equipped with a single antenna. The BSs cooperate in sharing their local interference information, and they aim at maximizing the sum rate of the users in the network. A set of new lower bounds (one bound for each BS) of the non-convex sum rate is identified. These bounds facilitate the development of a set of algorithms that allow the BSs to update their beams by optimizing their respective lower bounds. We show that when there is a single user per-BS, the lower bound maximization problem can be solved exactly with rank-1 solutions. In this case, the overall sum rate maximization problem can be solved to a KKT point. Numerical results show that the proposed algorithms achieve high system throughput with reduced backhaul information exchange among the BSs.

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

Lower Bounds Optimization for Coordinated Linear Transmission Beamformer Design in Multicell Network Downlink 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 Lower Bounds Optimization for Coordinated Linear Transmission Beamformer Design in Multicell Network Downlink, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds Optimization for Coordinated Linear Transmission Beamformer Design in Multicell Network Downlink will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-686764

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