Sum capacity of K user Gaussian degraded interference channels

This paper studies a family of genie-MAC (multiple access channel) outer bounds for K-user Gaussian interference channels. This family is inspired by existing genie-aided bounding mechanisms, but differs from current approaches in its optimization problem formulation and application. The fundamental idea behind these bounds is to create a group of genie receivers that form multiple access channels that can decode a subset of the original interference channel's messages. The MAC sum capacity of each of the genie receivers provides an outer bound on the sum of rates for this subset. The genie-MAC outer bounds are used to derive new sum-capacity results. In particular, this paper derives sum-capacity in closed-form for the class of K-user Gaussian degraded interference channels. The sum-capacity achieving scheme is shown to be a successive interference cancellation scheme. This result generalizes a known result for two-user channels to K-user channels.

[1]  S. Vishwanath,et al.  Algebraic lattice alignment for K-user interference channels , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Hiroshi Sato.  On degraded Gaussian two-user channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[3]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit: the General Case , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Gerhard Kramer,et al.  Outer bounds on the capacity of Gaussian interference channels , 2004, IEEE Transactions on Information Theory.

[5]  Syed Ali Jafar,et al.  Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[6]  Syed A. Jafar,et al.  Interference Alignment and the Degrees of Freedom for the 3 User Interference Channel , 2007 .

[7]  Amir K. Khandani,et al.  Capacity bounds for the Gaussian Interference Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Venugopal V. Veeravalli,et al.  Sum capacity of the Gaussian interference channel in the low interference regime , 2008, 2008 Information Theory and Applications Workshop.

[9]  Hiroshi Sato,et al.  The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.

[10]  Venugopal V. Veeravalli,et al.  Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region , 2009, IEEE Trans. Inf. Theory.

[11]  Erik Ordentlich,et al.  On the Degrees-of-Freedom of the K-user Gaussian interference channel , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[13]  Gerhard Kramer,et al.  A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels , 2007, IEEE Transactions on Information Theory.

[14]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

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

[16]  Venugopal V. Veeravalli,et al.  Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region , 2008, IEEE Transactions on Information Theory.

[17]  Igal Sason,et al.  On achievable rate regions for the Gaussian interference channel , 2004, IEEE Transactions on Information Theory.