Results 1  10
of
444
Interference alignment and the degrees of freedom for the Kuser interference channel
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2008
"... For the fully connected K user wireless interference channel where the channel coefficients are timevarying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR) = K 2 log(SNR) +o(log(SNR)). Thus, the K user timevarying interference channel almost surely has K ..."
Abstract

Cited by 433 (18 self)
 Add to MetaCart
For the fully connected K user wireless interference channel where the channel coefficients are timevarying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR) = K 2 log(SNR) +o(log(SNR)). Thus, the K user timevarying interference channel almost surely has K=2 degrees of freedom. Achievability is based on the idea of interference alignment. Examples are also provided of fully connected K user interference channels with constant (not timevarying) coefficients where the capacity is exactly achieved by interference alignment at all SNR values.
Breaking Spectrum Gridlock with Cognitive Radios: An Information Theoretic Perspective
, 2008
"... Cognitive radios hold tremendous promise for increasing spectral efficiency in wireless systems. This paper surveys the fundamental capacity limits and associated transmission techniques for different wireless network design paradigms based on this promising technology. These paradigms are unified b ..."
Abstract

Cited by 263 (4 self)
 Add to MetaCart
Cognitive radios hold tremendous promise for increasing spectral efficiency in wireless systems. This paper surveys the fundamental capacity limits and associated transmission techniques for different wireless network design paradigms based on this promising technology. These paradigms are unified by the definition of a cognitive radio as an intelligent wireless communication device that exploits side information about its environment to improve spectrum utilization. This side information typically comprises knowledge about the activity, channels, codebooks and/or messages of other nodes with which the cognitive node shares the spectrum. Based on the nature of the available side information as well as a priori rules about spectrum usage, cognitive radio systems seek to underlay, overlay or interweave the cognitive radios ’ signals with the transmissions of noncognitive nodes. We provide a comprehensive summary of the known capacity characterizations in terms of upper and lower bounds for each of these three approaches. The increase in system degrees of freedom obtained through cognitive radios is also illuminated. This information theoretic survey provides guidelines for the spectral efficiency gains possible through cognitive radios, as well as practical design ideas to mitigate the coexistence challenges in today’s crowded spectrum.
MultiCell MIMO Cooperative Networks: A New Look at Interference
 J. Selec. Areas in Commun. (JSAC
, 2010
"... Abstract—This paper presents an overview of the theory and currently known techniques for multicell MIMO (multiple input multiple output) cooperation in wireless networks. In dense networks where interference emerges as the key capacitylimiting factor, multicell cooperation can dramatically improv ..."
Abstract

Cited by 256 (40 self)
 Add to MetaCart
(Show Context)
Abstract—This paper presents an overview of the theory and currently known techniques for multicell MIMO (multiple input multiple output) cooperation in wireless networks. In dense networks where interference emerges as the key capacitylimiting factor, multicell cooperation can dramatically improve the system performance. Remarkably, such techniques literally exploit intercell interference by allowing the user data to be jointly processed by several interfering base stations, thus mimicking the benefits of a large virtual MIMO array. Multicell MIMO cooperation concepts are examined from different perspectives, including an examination of the fundamental informationtheoretic limits, a review of the coding and signal processing algorithmic developments, and, going beyond that, consideration of very practical issues related to scalability and systemlevel integration. A few promising and quite fundamental research avenues are also suggested. Index Terms—Cooperation, MIMO, cellular networks, relays, interference, beamforming, coordination, multicell, distributed.
Capacity bounds for the Gaussian interference channel
 IEEE TRANS. INFORM. THEORY
"... The capacity region of the twouser Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, onesided, and mixed Gaussian ICs. For the weak Gaussian IC, a new outer bound on the capacity region is obtained that outperforms previously known outer bounds. The cha ..."
Abstract

Cited by 156 (6 self)
 Add to MetaCart
The capacity region of the twouser Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, onesided, and mixed Gaussian ICs. For the weak Gaussian IC, a new outer bound on the capacity region is obtained that outperforms previously known outer bounds. The channel sum capacity for some certain range of the channel parameters is derived. It is shown that when Gaussian codebooks are used, the full HanKobayashi achievable rate region can be obtained by using the naive HanKobayashi achievable scheme over three frequency bands (equivalently, three subspaces). For the onesided Gaussian IC, a new proof for Sato’s outer bound is presented. We derive the full HanKobayashi achievable rate region when Gaussian code books are utilized. For the mixed Gaussian IC, a new outer bound is obtained that again outperforms previously known outer bounds. For this case, the channel sum capacity for all ranges of parameters is derived. It is proved that the full HanKobayashi achievable rate region using Gaussian codebooks is equivalent to that of the onesided Gaussian IC for a particular range of the channel gains.
The approximate capacity of the manytoone and onetomany Gaussian interference channels
 in Proc. Allerton Conf. Commun. Control Comput
, 2007
"... region of the twouser Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users. We make progress towards this goal by finding the capacity region of the manytoone and onetomany Gaussian in ..."
Abstract

Cited by 135 (9 self)
 Add to MetaCart
(Show Context)
region of the twouser Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users. We make progress towards this goal by finding the capacity region of the manytoone and onetomany Gaussian interference channels to within a constant number of bits. The result makes use of a deterministic model to provide insight into the Gaussian channel. The deterministic model makes explicit the dimension of signal level. A central theme emerges: the use of lattice codes for alignment of interfering signals on the signal level. Index Terms—Capacity, interference alignment, interference channel, lattice codes, multiuser channels. I.
Gaussian interference network: Sum capacity . . .
, 2008
"... Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference channel within one bit. In this paper, we develop new, impr ..."
Abstract

Cited by 131 (5 self)
 Add to MetaCart
(Show Context)
Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show that treating interference as noise achieves the sum capacity of the two user Gaussian interference channel in a low interference regime, where the interference parameters are below certain thresholds. We then generalize our techniques and results to Gaussian interference networks with more than two users. In particular, we demonstrate that the total interference threshold, below which treating interference as noise achieves the sum capacity, increases with the number of users.
Ergodic interference alignment
 in Proceedings of the International Symposium on Information Theory (ISIT 2009), (Seoul, South Korea
, 2009
"... Abstract—Consider a Kuser interference channel with timevarying fading. At any particular time, each receiver will see a signal from most transmitters. The standard approach to such a scenario results in each transmitterreceiver pair achieving a rate proportional to 1 the single user rate. However ..."
Abstract

Cited by 96 (25 self)
 Add to MetaCart
(Show Context)
Abstract—Consider a Kuser interference channel with timevarying fading. At any particular time, each receiver will see a signal from most transmitters. The standard approach to such a scenario results in each transmitterreceiver pair achieving a rate proportional to 1 the single user rate. However, given two K 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 interferencefree version of the desired transmission. We show that this technique allows each user to achieve at least half its interferencefree ergodic capacity at any SNR. Prior work was only able to show that half the interferencefree 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. I.
Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
, 2009
"... ..."
(Show Context)
Interference alignment for cellular networks
 in Communication, Control, and Computing, 2008 46th Annual Allerton Conference
, 2008
"... Abstract — In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to interferencefree degreeoffreedom (dof) as the number K of users in each cell increases. Also we find the corresponding bandwidth scaling conditions for typical ..."
Abstract

Cited by 79 (5 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to interferencefree degreeoffreedom (dof) as the number K of users in each cell increases. Also we find the corresponding bandwidth scaling conditions for typical wireless channels: multipath channels and singlepath channels with propagation delay. The scheme is based on interference alignment. Especially for morethantwocell cases where there are multiple nonintended BSs, we propose a new version of interference alignment, namely subspace interference alignment. The idea is to align interferences into multidimensional subspace (instead of one dimension) for simultaneous alignments at multiple nonintended BSs. The proposed scheme requires finite dimensions growing linearly with K, i.e., ∼ O(K). I.
On the DegreesofFreedom of the KUser Gaussian Interference Channel
 IEEE Transactions on Information Theory
, 2008
"... The degreesoffreedom of a Kuser Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log 2 P at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the degreesoffreedom of three or more user, real, scalar GIFCs, viewed ..."
Abstract

Cited by 78 (0 self)
 Add to MetaCart
(Show Context)
The degreesoffreedom of a Kuser Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log 2 P at which the maximum sum of achievable rates grows with increasing P. In this paper, we establish that the degreesoffreedom 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 nonzero rational numbers. More specifically, for all K> 2, we find a class of Kuser GIFCs that is dense in the GIFC parameter space for which K/2 degreesoffreedom are exactly achievable, and we show that the degreesoffreedom for any GIFC with nonzero rational coefficients is strictly smaller than K/2. These results are proved using new connections with number theory and additive combinatorics. 1