By Topic

Interference alignment in multi-carrier interference networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Changxin Shi ; Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA ; Berry, R.A. ; Honig, M.L.

We consider an interference network with multi-carrier transmission over M parallel sub-channels. There are K transmitter-receiver pairs, each transmitter transmits a single data stream with a rank-one precoding matrix, and the receivers are assumed to be linear. We show that a necessary condition for zero interference (alignment across sub-channels) is K ≤ 2M-2. In contrast, for a Multi-Input Multi-Output (MIMO) interference network with M×M spatial channels (full channel matrices) the corresponding condition is known to be K ≤ 2M - 1. We also characterize the sum rate at high Signal-to-Noise Ratios (SNR) by bounding the SNR offset (x-intercept) of the asymptote of the sum rate vs SNR curve. For a randomly chosen aligned solution as M increases, this offset shifts to the right as logM. In contrast, the SNR offset for a MIMO interference network does not increase with M. An approximation for the performance of sampling the best out of L aligned solutions is also presented. Numerical results show the analytical asymptotes accurately predict the sum rate curves at moderate to high SNRs.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011