Interference channel aided by an infrastructure relay
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Rate-maximizing mappings for memoryless relaying
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Capacity of a class of modulo-sum relay channels
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity of a Class of Deterministic Relay Channels
IEEE Transactions on Information Theory
On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication
IEEE Transactions on Information Theory
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Hi-index | 0.01 |
We consider the three-node Gaussian relay channel where the relay observes a noisy version of the interference present in the source-destination link. We investigate three fundamental relaying approaches: linear relaying, memoryless nonlinear relaying, and compress-and-forward (CF). For interference-limited cases, we illustrate that optimized memoryless nonlinear relaying almost achieves the capacity.