Group Based Interference Alignment

Author

Ma, Yanjun ; Li, Jiandong ; Liu, Qin ; Chen, Rui

Author_Institution

State Key Lab. of Integrated Service Networks, Xidian Univ., Xi´´an, China

Volume

15

Issue

4

fYear

2011

fDate

4/1/2011 12:00:00 AM

Firstpage

383

Lastpage

385

Abstract

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.

Keywords

fading channels; group theory; interference (signal); knapsack problems; multiplexing; K-user SISO frequency-selective fading interference channel; group based interference alignment; group patterns; multiplexing gain; unbounded knapsack problem; Antennas; Greedy algorithms; Heuristic algorithms; Integrated circuits; Interference; Multiplexing; Transmitters; Interference channel; interference alignment; knapsack problem; multiplexing gain;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2011.020111.102415

Filename

5713281