Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Computation Over Multiple-Access Channels
IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel
IEEE Transactions on Information Theory
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit
IEEE Transactions on Information Theory
K-user fading interference channels: the ergodic very strong case
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Degrees of freedom of multi-source relay networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A new achievable ergodic secrecy rate region for the fading multiple access wiretap channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Interference alignment at finite SNR: general message sets
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On the diversity-multiplexing tradeoff of multiuser amplify & forward multihop networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Enabling real-time interference alignment: promises and challenges
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
RobinHood: sharing the happiness in a wireless jungle
Proceedings of the 15th Workshop on Mobile Computing Systems and Applications
Hi-index | 0.00 |
Consider a K-user interference channel with time-varying fading. At any particular time, each receiver will see a signal from most transmitters. The standard approach to such a scenario results in each transmitter-receiver pair achieving a rate proportional to 1/K the single user rate. However, given two well chosen time indices, the channel coefficients from interfering users can be made to exactly cancel. By adding up these two signals, the receiver can see an interference-free version of the desired transmission. We show that this technique allows each user to achieve at least half its interference-free ergodic capacity at any SNR. Prior work was only able to show that half the interference-free rate was achievable as the SNR tended to infinity. We examine a finite field channel model and a Gaussian channel model. In both cases, the achievable rate region has a simple description and, in the finite field case, we prove it is the ergodic capacity region.