Back to Search
Start Over
Rate Allocation for Cooperative Orthogonal-Division Channels with Dirty-Paper Coding.
- Source :
-
IEEE Transactions on Communications . Oct2010, Vol. 58 Issue 10, p2949-2959. 0p. - Publication Year :
- 2010
-
Abstract
- 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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00906778
- Volume :
- 58
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- 54501916
- Full Text :
- https://doi.org/10.1109/TCOMM.2010.083110.070639