Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
Diversity-multiplexing tradeoff in multiple-access channels
IEEE Transactions on Information Theory
Sum capacity of Gaussian vector broadcast channels
IEEE Transactions on Information Theory
Capacity bounds for Cooperative diversity
IEEE Transactions on Information Theory
Degrees of Freedom Region of the MIMO X Channel
IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel
IEEE Transactions on Information Theory
Degrees of freedom of multi-source relay networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Interference alignment at finite SNR: general message sets
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Uncoded transmission in wireless relay networks using deterministic modeling
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
On feasibility of interference alignment in MIMO interference networks
IEEE Transactions on Signal Processing
Hi-index | 754.84 |
We find the degrees of freedom of a network with S source nodes, R relay nodes, and D destination nodes, with random time-varying/frequency-selective channel coefficients and global channel knowledge at all nodes. We allow full-duplex operation at all nodes, as well as causal noise-free feedback of all received signals to all source and relay nodes. An outer bound to the capacity region of this network is obtained. Combining the outer bound with previous interference alignment based achievability results, we conclude that the techniques of relays, feedback, full-duplex operation and noisy cooperation do not increase the degrees of freedom of interference and X networks. As a second contribution, we show that for a network with K full-duplex nodes and K (K - 1) independent messages with one message from every node to each of the other K - 1 node, the total degrees of freedom are bounded above and below by K(K - 1)/(2K - 2) and K(K - 1)/(2K - 3) respectively.