Clustering for Interference Alignment in Multiuser Interference Network

Interference alignment (IA) has been shown to be a promising technique for achieving the optimal capacity scaling of a multiuser interference channel at asymptotically high-signal-to-noise ratio (SNR). However, in practical communication systems, mitigating interference from all interferers via IA is not necessary since some users' interference have negligible effect due to large path-loss. Moreover, the feasibility constraint and the heavy signaling overhead hinder applying IA on interference from all interferers. Clustered IA puts users in disjoint clusters where IA is applied to users within each cluster. It provides a mechanism for mitigating the signaling overhead and maximizing the achievable rate. However, how to properly form IA clusters has not been well studied. We consider the application of clustered IA in a multiuser interference network with asymmetric channel attenuation at finite SNR. We model the interference network as a connected graph, transforming the clustering problem into a graph partitioning problem. By exploiting the variation on the interference levels from multiple interferers, efficient clustering algorithms are proposed such that clusters formed can capture strong interference as intracluster interference, leaving relatively weak interference as intercluster interference. Then, the intercluster interference can be coarsely modeled as noise. We also consider the precoder/equalizer design in a clustered system and show the importance of incorporating the aggregated intercluster interference in the design. Simulation results show that proper clustering combined with generalized IA precoder/equalizer design leads to significant gains on the achievable sum rate.

[1]  Chung-Kuan Cheng,et al.  Towards efficient hierarchical designs by ratio cut partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Syed Ali Jafar,et al.  A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks , 2011, IEEE Transactions on Information Theory.

[4]  Robert W. Heath,et al.  Cooperative Algorithms for MIMO Interference Channels , 2010, IEEE Transactions on Vehicular Technology.

[5]  Robert W. Heath,et al.  Interference alignment via alternating minimization , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[6]  Maxime Guillaud,et al.  Performance of interference alignment in clustered wireless ad hoc networks , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[8]  Roger S. Cheng,et al.  Clustering for Interference Alignment in a Multiuser Interference Channel , 2012, 2012 IEEE 75th Vehicular Technology Conference (VTC Spring).

[9]  Robert W. Heath,et al.  Maximum Sum-Rate Interference Alignment Algorithms for MIMO Channels , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[10]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[11]  George A. F. Seber,et al.  A matrix handbook for statisticians , 2007 .

[12]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[13]  David Tse,et al.  Feasibility of Interference Alignment for the MIMO Interference Channel , 2013, IEEE Transactions on Information Theory.

[14]  Erwin Riegler,et al.  A Clustered Alignment-Based Interference Management Approach for Large OFDMA Cellular Networks , 2009 .

[15]  R. Berry,et al.  Minimum Mean Squared Error interference alignment , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[16]  Michael A. Trick,et al.  Cliques and clustering: A combinatorial approach , 1998, Oper. Res. Lett..

[17]  John E. Mitchell,et al.  Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement , 2007, Discret. Optim..

[18]  Erwin Riegler,et al.  On the achievability of interference alignment in the K-user constant MIMO interference channel , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.

[19]  Vincent K. N. Lau,et al.  Partial Interference Alignment for $K$-User MIMO Interference Channels , 2011, IEEE Transactions on Signal Processing.

[20]  Robert W. Heath,et al.  User Partitioning for Less Overhead in MIMO Interference Channels , 2010, IEEE Transactions on Wireless Communications.

[21]  Zhi-Quan Luo,et al.  On the Degrees of Freedom Achievable Through Interference Alignment in a MIMO Interference Channel , 2011, IEEE Transactions on Signal Processing.

[22]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[23]  A. H. Kayran,et al.  On Feasibility of Interference Alignment in MIMO Interference Networks , 2009, IEEE Transactions on Signal Processing.

[24]  Jeffrey G. Andrews,et al.  MIMO Interference Alignment Over Correlated Channels With Imperfect CSI , 2010, IEEE Transactions on Signal Processing.

[25]  Amir K. Khandani,et al.  Interference alignment for the K user MIMO interference channel , 2009, 2010 IEEE International Symposium on Information Theory.

[26]  Maxime Guillaud,et al.  Clustered interference alignment in large cellular networks , 2009, 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications.