Capacity bounds for the Gaussian interference channel
IEEE Transactions on Information Theory
A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels
IEEE Transactions on Information Theory
Outer bounds on the capacity of Gaussian interference channels
IEEE Transactions on Information Theory
On achievable rate regions for the Gaussian interference channel
IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel
IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit
IEEE Transactions on Information Theory
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Algebraic lattice alignment for K-user interference channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal multiplexing gain of K-user line-of-sight interference channels with polarization
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Hi-index | 0.00 |
The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2) log2 P at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the degrees-of-freedom of three or more user, real, scalar GIFCs, viewed as a function of the channel coefficients, is discontinuous at points where all of the coefficients are non-zero rational numbers. More specifically, for all K 2, we find a class of K-user GIFCs that is dense in the GIFC parameter space for which K/2 degrees-of-freedom are exactly achievable, and we show that the degrees-of-freedom for any GIFC with non-zero rational coefficients is strictly smaller than K/2. These results are proved using new connections with number theory and additive combinatorics.