Achievable DoF and Its User Scaling Law for Opportunistic User Selection in a $K$-transmitter SIMO Interference Channel

Details Achievable DoF and Its User Scaling Law for Opportunistic User Selection in a $K$-transmitter SIMO Interference Channel Achievable DoF and Its User Scaling Law for Opportunistic User Selection in a $K$-transmitter SIMO Interference Channel

2011-11-04

arxiv.org/abs/1111.1051v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory

Scientific paper

In this paper, we consider a $K$-transmitter single-input multiple-output (SIMO) interference channel (IC) where each transmitter has its own user group and serves one of the users in its group. When the number of receive antennas at each user is less than $K$ (i.e., $N_R

Affiliated with

Also associated with

No associations

Rating

Achievable DoF and Its User Scaling Law for Opportunistic User Selection in a $K$-transmitter SIMO Interference Channel 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 Achievable DoF and Its User Scaling Law for Opportunistic User Selection in a $K$-transmitter SIMO Interference Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable DoF and Its User Scaling Law for Opportunistic User Selection in a $K$-transmitter SIMO Interference Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100590