Results 1  10
of
93
Gaussian interference channel capacity to within one bit
 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing
"... Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing o ..."
Abstract

Cited by 451 (28 self)
 Add to MetaCart
(Show Context)
Abstract—The capacity of the twouser Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a very simple and explicit Han–Kobayashi type scheme can achieve to within a single bit per second per hertz (bit/s/Hz) of the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high signaltonoise ratio (SNR) regimes. Using our results, we provide a natural generalization of the pointtopoint classical notion of degrees of freedom to interferencelimited scenarios. Index Terms—Capacity region, Gaussian interference channel, generalized degrees of freedom.
Communication over mimo x channels: Interference alignment, decomposition, and performance analysis
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2008
"... In a multipleantenna system with two transmitters and two receivers, a scenario of data communication, known as the X channel, is studied in which each receiver receives data from both transmitters. In this scenario, it is assumed that each transmitter is unaware of the other transmitter’s data (n ..."
Abstract

Cited by 207 (12 self)
 Add to MetaCart
(Show Context)
In a multipleantenna system with two transmitters and two receivers, a scenario of data communication, known as the X channel, is studied in which each receiver receives data from both transmitters. In this scenario, it is assumed that each transmitter is unaware of the other transmitter’s data (noncooperative scenario). This system can be considered as a combination of two broadcast channels (from the transmitters ’ points of view) and two multipleaccess channels (from the receivers ’ points of view). Taking advantage of both perspectives, two signaling schemes for such a scenario are developed. In these schemes, some linear filters are employed at the transmitters and at the receivers which decompose the system into either two noninterfering multipleantenna broadcast subchannels or two noninterfering multipleantenna multipleaccess subchannels. The main objective in the design of the filters is to exploit the structure of the channel matrices to achieve the
A new outer bound and the noisyinterference sumrate capacity for Gaussian interference channels
 IEEE International Symposium on Information Theory
, 2008
"... Abstract — A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genieaided methods and is shown to give the sumrate capacity for Gaussian interference channel with noisy interference as defined in this paper. Specifically ..."
Abstract

Cited by 163 (10 self)
 Add to MetaCart
Abstract — A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genieaided methods and is shown to give the sumrate capacity for Gaussian interference channel with noisy interference as defined in this paper. Specifically, it is shown that if the channel coefficients and power constraints satisfy a simple condition then singleuser detection at each receiver is sumrate optimal, i.e., treating the interference as noise incurs no loss in performance. Finally, we generalize the noisy interference sumrate capacity to muser interference channels. Index terms — capacity, Gaussian noise, interference. 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 133 (5 self)
 Add to MetaCart
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.
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)
On interference channels with generalized feedback
 In Proceedings of IEEE Int. Symp. on Inform. Theory, ISIT2007
, 2007
"... An Interference Channel with Generalized Feedback (IFCGF) is a model for a wireless network where several sourcedestination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel activity. The signal overheard from the channel provides inf ..."
Abstract

Cited by 48 (9 self)
 Add to MetaCart
An Interference Channel with Generalized Feedback (IFCGF) is a model for a wireless network where several sourcedestination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel activity. The signal overheard from the channel provides information about the activity of the other users, and thus furnishes the basis for cooperation. In this twopart paper we study achievable strategies and outer bounds for a general IFCGF with two sourcedestination pairs. We then evaluate the proposed regions for the Gaussian channel. Part I: Achievable Region. We propose that the generalized feedback is used to gain knowledge about the message sent by the other user and then exploited in two ways: (a) to relay the messages that can be decoded at both destinations–thus realizing the gains of beamforming of a distributed multiantenna system–and (b) to hide the messages that can not be decoded at the nonintended destination–thus leveraging the interference “precancellation” property of dirtypapertype coding. We show that our achievable region generalizes several known achievable regions for IFCGF and that it reduces
Capacity of Symmetric KUser Gaussian Very Strong Interference Channels
 In IEEE Global Telecommunication Conference
, 2008
"... Abstract—This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A “very strong ” interference regime is derived for this channel setup. A “very strong ” interference regime is one where the capacity region of the interference channel is the same as t ..."
Abstract

Cited by 43 (11 self)
 Add to MetaCart
(Show Context)
Abstract—This paper studies a symmetric K user Gaussian interference channel with K transmitters and K receivers. A “very strong ” interference regime is derived for this channel setup. A “very strong ” interference regime is one where the capacity region of the interference channel is the same as the capacity region of the channel with no interference. In this regime, the interference can be perfectly canceled by all the receivers without incurring any rate penalties. A “very strong ” interference condition for an example symmetric K user deterministic interference channel is also presented. I.
On the secrecy of multiple access wiretap channel
 In 46th Annual Allerton Conference on Communications, Control and Computing
, 2008
"... Abstract — We develop an outer bound for the secrecy capacity region of a class of multiple access wiretap channels (MACWT). In this class, which we call the weak eavesdropper class, each user’s link to the legitimate receiver is stronger than its link to the eavesdropper. Our outer bound partially ..."
Abstract

Cited by 40 (20 self)
 Add to MetaCart
(Show Context)
Abstract — We develop an outer bound for the secrecy capacity region of a class of multiple access wiretap channels (MACWT). In this class, which we call the weak eavesdropper class, each user’s link to the legitimate receiver is stronger than its link to the eavesdropper. Our outer bound partially matches the achievable region in an nletter form. In addition, a looser version of our outer bound provides close approximations to the capacity region of the Gaussian MACWT channel. In particular, we prove that our outer bound is within 0.5 bits/channel use of the achievable rates along the individual rates for all weak eavesdropper Gaussian MACWT, and within 0.5 bits/channel use in all directions for certain weak eavesdropper Gaussian MACWT channels. I.
Degrees of Freedom of the K User M × N MIMO Interference Channel
, 809
"... We provide innerbound and outerbound for the total number of degrees of freedom of the K user multiple input multiple output (MIMO) Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver if the channel coefficients are timevarying and drawn from a continuo ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
(Show Context)
We provide innerbound and outerbound for the total number of degrees of freedom of the K user multiple input multiple output (MIMO) Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver if the channel coefficients are timevarying and drawn from a continuous distribution. The bounds are tight when the ratio max(M,N) min(M,N) = R is equal to an integer. For this case, we show that the total number of degrees of freedom is equal to min(M, N)K if K ≤ R and min(M, N) R R+1K if K> R. Achievability is based on interference alignment. We also provide examples where using interference alignment combined with zero forcing can achieve more degrees of freedom than merely zero forcing for some MIMO interference channels with constant channel coefficients. 2 I.
Sum capacity of the Gaussian interference channel in the low interference regime
 in Proceedings of ITA Workshop
, 2008
"... Abstract — New upper bounds on the sum capacity of the twouser Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain thresholds. I. ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
(Show Context)
Abstract — New upper bounds on the sum capacity of the twouser Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain thresholds. I.