Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels

Cadambe, Viveck R.; Jafar, Syed A.

doi:10.1109/glocom.2008.ecp.904

Cited by 21 publications

(19 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a subsequent work, Host-Madsen and Nosratinia [9] showed that the sum-rate multiplexing gain of a K user SISO IFC-GF cannot exceed K/2. Cadambe and Jafar [14] showed that a sum-rate multiplexing gain of K/2 is actually achievable in ergodic timevarying fully-connected IFCs, even without user cooperation, by a transmission technique named interference alignment. Recently, Prabhakaran and Viswanath in [15] derived the sumrate multiplexing gain of the high-SNR deterministic approximation of a Gaussian IFC-GF for fully symmetric networks.…”

Section: Introductionmentioning

confidence: 99%

A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback

Yang

Tuninetti

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Interference Channels (IFC) with Generalized Feedback (GF) model wireless channels where every node overhears the transmission of other nodes and uses it to engage in cooperative communication strategies. The overheard signals, instead of being treated as interference, furnish the basis for cooperation among otherwise uncoordinated users. Although cooperative communications is not equivalent to virtual Multi-Input-MultiOutput (MIMO) communications, it has been shown to benefit the rate performance of all the involved source-destination pairs without increasing neither their transmit powers nor the channel bandwidth. This paper develops a new sum-rate outer bound for Gaussian IFC-GFs based on the idea of giving the receivers the least informative GF signal as side information. We compare our new outer bound with bounds available in the literature and numerically show for which network parameters our bound strictly improves on existing ones.

show abstract

Section: Introductionmentioning

confidence: 99%

A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback

Yang

Tuninetti

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…One also has to deal with the fact that parallel interference channels are inseparable [4], [5]. That is, one cannot separately code for each channel instances and simply allocate power across these codes.…”

Section: Introductionmentioning

confidence: 99%

Interference alignment at finite SNR: General message sets

Nazer

Gastpart

Jafar

et al. 2009

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Interference alignment has proven to be a powerful tool in characterizing the high SNR behavior of wireless networks. Using this technique, Cadambe and Jafar showed that the sum degrees-of-freedom for the K-user interference channel is K/2 rather than 1 as was originally expected. In recent work, we showed that these gains are not limited to the high SNR regime. In fact, for the interference channel, each user can achieve at least half its interference-free capacity at any SNR. The key to this result was a new achievability technique called ergodic interference alignment. In this paper, we extend this technique to include more general message sets. Specifically, we consider the multicast case where each transmitter has a message destined for more than one receiver. We also look at the X channel configuration for 2 receivers where each transmitter has an independent message for each receiver.

show abstract

“…This was subsequently used in the DOF analysis for the two user X channel in [5], [6]. Recent works that consider the DOF of wireless networks under different network settings include [7]- [10]. Outer bounds on the DOF were derived in [11] and [12].…”

Section: Introductionmentioning

confidence: 99%

Interference Alignment Algorithms for the $K$ User Constant MIMO Interference Channel

Mohapatra

Nissar

Murthy

2011

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

This paper considers the degrees of freedom (DOF) for a user multiple-input multiple-output (MIMO) interference channel using interference alignment (IA). A new performance metric for evaluating the efficacy of IA algorithms is proposed, which measures the extent to which the desired signal dimensionality is preserved after zero-forcing the interference at the receiver. Inspired by the metric, two algorithms are proposed for designing the linear precoders and receive filters for IA in the constant MIMO interference channel with a finite number of symbol extensions. The first algorithm uses an eigenbeamforming method to align sub-streams of the interference to reduce the dimensionality of the interference at all the receivers. The second algorithm is iterative, and is based on minimizing the interference leakage power while preserving the dimensionality of the desired signal space at the intended receivers. The improved performance of the algorithms is illustrated by comparing them with existing algorithms for IA using Monte Carlo simulations.Index Terms-Degrees of freedom, interference alignment, interference channels, precoder design.

show abstract

Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels

Cited by 21 publications

References 18 publications

A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback

A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback

Interference alignment at finite SNR: General message sets

Interference Alignment Algorithms for the $K$ User Constant MIMO Interference Channel

Contact Info

Product

Resources

About