Paper Info
Title
Interference Subspace Tracking for Network Interference Alignment in Cellular Systems
Abstract
In this paper, a practical solution to implement the distributed interference alignment (IA) algorithm of [1] in a cellular communication system is proposed. In the training period of the proposed strategy, the User Equipment (UE) and the Base Station (BS), without knowing a priori the interference covariance matrix, update directly the preceding and interference suppression matrices based on the received signals by a minor subspace tracking algorithm. At the end of the training phase, the preceding and interference suppression matrices are then used at the UE and BS, respectively, for the transmission period. A special spatial reuse method is also proposed for the training period to lower the system overhead. Numerical system performance results are provided, showing that the algorithm, referred to as Interference Subspace Tracking IA (IST-IA), yields a good tradeoff between throughput gains, on one side, and training overhead and computational complexity, on the other. It is also argued that IST-IA is a promising solution not only for training but also for the tracking phase, if applicable.
Year
DOI
Venue
2009
10.1109/GLOCOM.2009.5426236
GLOBECOM
Keywords
Field
DocType
base station,training period,user equipment,minor subspace tracking algorithm,interference covariance matrix,interference suppression matrix,network interference alignment,radiofrequency interference,interference alignment,system overhead,cellular radio,spatial reuse method,covariance matrices,ia algorithm,computational complexity,distributed interference alignment,training overhead,numerical system performance result,cellular communication system,interference suppression,training phase,cellular system,interference subspace tracking,covariance matrix,communication system
Subspace topology,Simulation,Computer science,Algorithm,Real-time computing,User equipment,Interference (wave propagation),Zero-forcing precoding,Covariance matrix,Throughput,Precoding,Computational complexity theory
Conference
ISSN
ISBN
Citations 
1930-529X
978-1-4244-4148-8
8
PageRank 
References 
Authors
0.61
6
2
Name
Order
Citations
PageRank
Bo Niu1293.52
Alexander M. Haimovich261869.28