Results 1  10
of
162
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 430 (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 265 (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.
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.
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 (24 self)
 Add to MetaCart
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.
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 79 (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
Wireless Information Transfer with Opportunistic Energy Harvesting
 Wireless Communications, IEEE Transactions on
, 2013
"... ar ..."
(Show Context)
Optimal power policy for energy harvesting transmitters with inefficient energy storage
 in Proc. Annual Conference on Information Sciences and Systems (CISS
, 2012
"... ar ..."
(Show Context)
Aligned interference neutralization and the degrees of freedom of the 2×2×2 interference channel with . . .
, 2010
"... Previous work showed that the 2×2×2 interference channel, i.e., the multihop interference network formed by concatenation of two 2user interference channels, achieves the mincut outer bound value of 2 DoF. This work studies the 2×2×2 interference channel with one additional assumption that two re ..."
Abstract

Cited by 52 (14 self)
 Add to MetaCart
Previous work showed that the 2×2×2 interference channel, i.e., the multihop interference network formed by concatenation of two 2user interference channels, achieves the mincut outer bound value of 2 DoF. This work studies the 2×2×2 interference channel with one additional assumption that two relays interfere with each other. It is shown that even in the presence of the interfering links between two relays, the mincut outer bound of 2 DoF can still be achieved for almost all values of channel coefficients, for both fixed or timevarying channel coefficients. The achievable scheme relies on the idea of aligned interference neutralization as well as exploiting memory at source and relay nodes.