Interference Alignment for Line-of-Sight Channels

The fully connected K-user interference channel is studied in a multipath environment with bandwidth W. We show that when each link consists of D physical paths, the total spectral efficiency can grow linearly with K . This result holds not merely in the limit of large transmit power P, but for any fixed P , and is, therefore, a stronger characterization than degrees of freedom. It is achieved via a form of interference alignment in the time domain. A caveat of this result is that W must grow with K, a phenomenon we refer to as bandwidth scaling. Our insight comes from examining channels with single path links (D=1), which we refer to as line-of-sight (LOS) links. For such channels, we build a time-indexed interference graph and associate the communication problem with finding its maximum independent set. This graph has a stationarity property that we exploit to solve the problem efficiently via dynamic programming. Additionally, the interference graph enables us to demonstrate the necessity of bandwidth scaling for any scheme operating over LOS interference channels. Bandwidth scaling is then shown to also be a necessary ingredient for interference alignment in the K-user interference channel.

[1]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[2]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[3]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[4]  Amir K. Khandani,et al.  Signaling over MIMO Multi-Base Systems: Combination of Multi-Access and Broadcast Schemes , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Massimo Franceschetti,et al.  The Capacity of Wireless Networks: Information-Theoretic and Physical Limits , 2009, IEEE Transactions on Information Theory.

[6]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[7]  Shlomo Shamai,et al.  Degrees of Freedom Region of the MIMO $X$ Channel , 2008, IEEE Transactions on Information Theory.

[8]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[12]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .