• Publications
  • Influence
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
  • V. Cadambe, S. Jafar
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 3 July 2007
TLDR
We have shown that with perfect channel knowledge the user interference channel has (almost surely) degrees of freedom when the channel coefficients are time-varying and are generated from a continuous distribution. Expand
  • 2,704
  • 381
  • PDF
A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks
TLDR
In this work, we provide examples of iterative algorithms that utilize the reciprocity of wireless networks to achieve interference alignment with only local channel knowledge at each node. Expand
  • 813
  • 188
  • PDF
Approaching the Capacity of Wireless Networks through Distributed Interference Alignment
TLDR
We provide examples of iterative algorithms that utilize the reciprocity of wireless networks to achieve interference alignment with only local channel knowledge at each node. Expand
  • 774
  • 137
  • PDF
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective
TLDR
This paper surveys the fundamental capacity limits and associated transmission techniques for different wireless network design paradigms based on this promising technology. Expand
  • 2,291
  • 135
  • PDF
Capacity limits of MIMO channels
TLDR
We provide an overview of the extensive results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels. Expand
  • 2,238
  • 122
  • PDF
Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel
  • V. Cadambe, S. Jafar
  • Computer Science, Mathematics
  • IEEE International Conference on Communications
  • 3 July 2007
TLDR
We show that the sum capacity of the K user frequency selective (or time-varying) interference channel is C(SNR) = (K/2) log( SNR) +o(log(SNr)) meaning that the channel has a total of K/2 degrees of freedom per orthogonal time and frequency dimension. Expand
  • 598
  • 108
  • PDF
On Feasibility of Interference Alignment in MIMO Interference Networks
TLDR
We explore the feasibility of interference alignment in signal vector space-based only on beamforming-for K-user MIMO interference channels. Expand
  • 697
  • 91
  • PDF
Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
TLDR
We use a "duality" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies. Expand
  • 463
  • 57
  • PDF
The Capacity of Private Information Retrieval
TLDR
In the private information retrieval (PIR) problem a user wishes to retrieve, as efficiently as possible, one out of $K$ messages from $N$ non-communicating databases while revealing nothing about the identity of the desired message index. Expand
  • 178
  • 56
  • PDF
Degrees of Freedom Region of the MIMO $X$ Channel
  • S. Jafar, S. Shamai
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 21 July 2006
TLDR
We provide achievability as well as converse results for the degrees of freedom region of a multiple-input multiple-output (MIMO) X channel, i.e., a system with two transmitters, two receivers, each equipped with multiple antennas, where independent messages need to be conveyed over fixed channels. Expand
  • 766
  • 54
  • PDF
...
1
2
3
4
5
...