Elements of information theory
Elements of information theory
Capacity bounds for the Gaussian interference channel
IEEE Transactions on Information Theory
A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Bounds on achievable rates for general multi-terminal networks with practical constraints
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Power Control for Fading Cooperative Multiple Access Channels
IEEE Transactions on Wireless Communications
When network coding and dirty paper coding meet in a cooperative ad hoc network
IEEE Transactions on Wireless Communications - Part 2
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Capacity of a class of relay channels with orthogonal components
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Capacity bounds for Cooperative diversity
IEEE Transactions on Information Theory
Capacity of Interference Channels With Partial Transmitter Cooperation
IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper investigates how much the rate region of the two-user Gaussian interference channel can be enlarged by allowing the two source nodes to cooperate. Two cooperative transmission schemes are proposed, based on dirty-paper coding and the assumption that the radio bandwidth is partitioned into two parts, and each part is utilized by one source node. The achievable rate regions and the outage performance of these two schemes are compared with the simplified Han-Kobayashi scheme, which is an efficient coding scheme for the interference channel. Simulation results show that in some channel realizations, the rate region of the Han-Kobayashi scheme is a subset of the rate regions of our two proposed cooperative transmission schemes. Furthermore, a significant gain in outage performance can be obtained, as the cooperative schemes have twice the diversity order of the simplified Han-Kobayashi scheme. While both cooperative schemes are able to yield large diversity gain, one of them can be implemented by simple decoder. Besides, it has an efficient algorithm for maximizing its weighted sum rate, and can be extended easily to the multi-channel case.