Group Based Interference Alignment

Details Group Based Interference Alignment Group Based Interference Alignment

2010-07-07

arxiv.org/abs/1007.1174v3

Computer Science

Information Theory

3 pages, 3 figures. resubmitted to IEEE Communications Letters

Scientific paper

In the $K$-user single-input single-output (SISO) frequency-selective fading interference channel, it is shown that the maximal achievable multiplexing gain is almost surely $K/2$ by using interference alignment (IA). However, when the signaling dimensions are limited, allocating all the resources to all users simultaneously is not optimal. So, a group based interference alignment (GIA) scheme is proposed, and it is formulated as an unbounded knapsack problem. Optimal and greedy search algorithms are proposed to obtain group patterns. Analysis and numerical results show that the GIA scheme can obtain a higher multiplexing gain when the resources are limited.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345763