User Arrival in MIMO Interference Alignment Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 6 figures, submitted to IEEE Transactions on Wireless Communications

Scientific paper

In this paper we analyze a constant multiple-input multiple-output interference channel where a set of active users are cooperating through interference alignment while a set of secondary users desire access to the channel. We derive the minimum number of secondary transmit antennas required so that a secondary user can use the channel without affecting the sum rate of the active users, under a zero-forcing equalization assumption. When the secondary users have enough antennas, we derive several secondary user precoders that approximately maximize the secondary users' sum rate without changing the sum rate of the active users. When the secondary users do not have enough antennas, we perform numerical optimization to find secondary user precoders that cause minimum degradation to the sum rate of the active users. Through simulations, we confirm that i) with enough antennas at the secondary users, gains equivalent to the case of all the users cooperating through interference alignment is obtainable, and ii) when the secondary users do not have enough antennas, large rate losses at the active users can be avoided.

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

User Arrival in MIMO Interference Alignment Networks 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 User Arrival in MIMO Interference Alignment Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and User Arrival in MIMO Interference Alignment Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-637686

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