# Degrees of Freedom of Interference Channels With CoMP Transmission and Reception

@article{Annapureddy2012DegreesOF,
title={Degrees of Freedom of Interference Channels With CoMP Transmission and Reception},
author={V. Annapureddy and A. E. Gamal and V. Veeravalli},
journal={IEEE Transactions on Information Theory},
year={2012},
volume={58},
pages={5740-5760}
}
• Published 2012
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
We study the degrees of freedom (DoF) of the <formula formulatype="inline"><tex Notation="TeX">$K$</tex></formula>-user interference channel with coordinated multipoint (CoMP) transmission and reception. Each message is jointly transmitted by <formula formulatype="inline"><tex Notation="TeX">$M_{t}$</tex></formula> successive transmitters, and is jointly received by <formula formulatype="inline"><tex Notation="TeX">$M_{r}$</tex></formula> successive receivers. We refer to this channel as the… Expand

#### Figures and Topics from this paper

• Mathematics, Computer Science
• IEEE Transactions on Communications
• 2020
New achievable average uplink-downlink puDoF values are introduced, and their optimality for the range is shown when <inline-formula> <tex-math notation="LaTeX">$N_{c} \leq \frac {L}{2}$ </tex- math></inline- formula> and when the authors restrict their attention to zero-forcing schemes. Expand
Degrees of Freedom of Interference Channels With Hybrid Beamforming
• Mathematics, Computer Science
• IEEE Transactions on Wireless Communications
• 2016
The results show that with a fixed number of RF chains, employing more antennas can increase the sum DoF of interference channel under certain conditions while this cannot improve the sum doFs of point-to-point channel, multiple access channel, and broadcast channel. Expand
Degrees of freedom for the constant MIMO interference channel with CoMP transmission
• Physics, Computer Science
• 2013 Asilomar Conference on Signals, Systems and Computers
• 2013
The degrees of freedom analysis is shown through simulations to provide a good guideline for choosing how many beams each user should send. Expand
Degrees of Freedom for the Constant MIMO Interference Channel With CoMP Transmission
• Computer Science
• IEEE Transactions on Communications
• 2014
The degrees of freedom analysis is shown through simulations to provide a good guideline for choosing how many beams each user should send for the iterative algorithms. Expand
Degrees of Freedom of Cache-Aided Wireless Cellular Networks
• Computer Science, Mathematics
• IEEE Transactions on Communications
• 2020
This work investigates the degrees of freedom (DoF) of a downlink cache-aided cellular network where the locations of base stations (BSs) are modeled as a grid topology and users within a grid cellExpand
Interference Channels With Coordinated Multipoint Transmission: Degrees of Freedom, Message Assignment, and Fractional Reuse
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2014
The capacity gain achieved through CoMP transmission is studied in various models of wireless networks that have practical significance and the capacity gain is analyzed through the degrees of freedom (DoF) criterion. Expand
Degrees of Freedom of the Three-User Rank-Deficient MIMO Interference Channel
• Mathematics, Computer Science
• IEEE Transactions on Wireless Communications
• 2014
existing techniques developed for full-rank MIMO-IC can be incorporated to derive the DoF outer and inner bounds for the rank-deficient case, and it is shown that when the interfering links are weak in terms of the channel ranks, zero forcing is sufficient to achieve the optimal DoF. Expand
On optimal message assignments for interference channels with CoMP transmission
• Computer Science, Mathematics
• 2012 46th Annual Conference on Information Sciences and Systems (CISS)
• 2012
This work relaxes the cooperation constraint such that each message can be assigned to M transmitters without imposing further constraints on their location and studies properties for different message assignments in terms of the gain in the per user DoF number over that achieved without cooperation. Expand
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2016
The result demonstrates that, for a broad class of network configurations, operating one of the two cells as uplink and the other cell as downlink can strictly improve the sum DoF compared with the conventional uplink or downlink operation, in which both cells operate as either uplinkor downlink. Expand
Degrees of Freedom of Interference Networks with Transmitter-Side Caches
• Computer Science, Mathematics
• ArXiv
• 2017
An information-theoretic bound on the sum-DoF is provided on a commonly used uncoded placement strategy and it is demonstrated by an example that the derived bound is tighter than the bounds existing in the literature for small cache sizes. Expand

#### References

SHOWING 1-10 OF 58 REFERENCES
On optimal message assignments for interference channels with CoMP transmission
• Computer Science, Mathematics
• 2012 46th Annual Conference on Information Sciences and Systems (CISS)
• 2012
This work relaxes the cooperation constraint such that each message can be assigned to M transmitters without imposing further constraints on their location and studies properties for different message assignments in terms of the gain in the per user DoF number over that achieved without cooperation. Expand
Interference Alignment and the Degrees of Freedom of Wireless $X$ Networks
• Computer Science
• IEEE Transactions on Information Theory
• 2009
It is shown that the total number of degrees of freedom of the X network is equal to [(MN)/(M+N-1)] per orthogonal time and frequency dimension, and that the degrees offreedom outer bound is exactly achievable. Expand
Achievable degrees of freedom of the K-user interference channel with partial cooperation
• Mathematics, Computer Science
• 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)
• 2011
A signal space-based interference alignment scheme that proves the achievability of these degrees of freedom for the case K= M+2 and consists of a design for the transmit precoding matrices and a processing algorithm which is called the Successive Interference Alignment (SIA) algorithm. Expand
Degrees of Freedom Region of the MIMO $X$ Channel
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2008
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, eachExpand
Degrees of Freedom of the K User M times N MIMO Interference Channel
• Physics, Mathematics
• IEEE Trans. Inf. Theory
• 2010
We provide inner bound and outer bound 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 transmitterExpand
Degrees of Freedom of the User MIMO Interference Channel
• Mathematics
• 2010
We provide inner bound and outer bound for the total number of degrees of freedom of the user multiple-input mul- tiple-output (MIMO) Gaussian interference channel with an- tennas at each transmitterExpand
On the Degrees of Freedom Achievable Through Interference Alignment in a MIMO Interference Channel
• Mathematics, Computer Science
• IEEE Transactions on Signal Processing
• 2011
This work establishes a general condition that must be satisfied by any degrees of freedom tuple (d1. d2....dK) achievable through linear interference alignment that implies that the total achievable DoF cannot grow linearly with K, and is in fact no more than K(M + N)/(K + 1). Expand
Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
• Physics, Computer Science
• IEEE Transactions on Information Theory
• 2014
It is proved that constellations can be aligned in a similar fashion as that of vectors in multiple antenna systems and space can be broken up into fractional dimensions. Expand
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2008
For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log (SNR)+o(log( SNR), which almost surely has K/2 degrees of freedom. Expand
Degrees of Freedom of Wireless Networks With Relays, Feedback, Cooperation, and Full Duplex Operation
• Computer Science
• IEEE Transactions on Information Theory
• 2009
It is concluded that the techniques of relays, feedback, full-duplex operation and noisy cooperation do not increase the degrees of freedom of interference and X networks. Expand