Computer Science – Information Theory
Scientific paper
2010-07-03
Computer Science
Information Theory
34 pages, 11 figures, to appear in IEEE Trans. Wireless Communications
Scientific paper
This paper presents a study on multiple-antenna interference channels, accounting for general overhead as a function of the number of users and antennas in the network. The model includes both perfect and imperfect channel state information based on channel estimation in the presence of noise. Three low complexity methods are proposed for reducing the impact of overhead in the sum network throughput by partitioning users into orthogonal groups. The first method allocates spectrum to the groups equally, creating an imbalance in the sum rate of each group. The second proposed method allocates spectrum unequally among the groups to provide rate fairness. Finally, geographic grouping is proposed for cases where some receivers do not observe significant interference from other transmitters. For each partitioning method, the optimal solution not only requires a brute force search over all possible partitions, but also requires full channel state information, thereby defeating the purpose of partitioning. We therefore propose greedy methods to solve the problems, requiring no instantaneous channel knowledge. Simulations show that the proposed greedy methods switch from time-division to interference alignment as the coherence time of the channel increases, and have a small loss relative to optimal partitioning only at moderate coherence times.
Heath Robert W. Jr.
Peters Steven W.
No associations
LandOfFree
User Partitioning for Less Overhead in MIMO Interference Channels 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 Partitioning for Less Overhead in MIMO Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and User Partitioning for Less Overhead in MIMO Interference Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-441289