Have a personal or library account? Click to login
Compress-and-Forward for Relay Broadcast Channels without Common Messages Cover

Compress-and-Forward for Relay Broadcast Channels without Common Messages

By: Xiaoxia Song and  Yong Li  
Open Access
|Jul 2015

Abstract

This paper is connected with compress-and-forward strategy for two-user relay broadcast channels without common messages, where the relay node has private messages from the source, in addition to aiding traditional communication from the source to the destination. For this channel we derive two achievable rate regions based on the compress-and-forward strategy in cases of discrete memoryless channels and Gaussian channels, respectively. The numerical results for Gaussian relay broadcast channel show that the inner bound based on the compress-and-forward strategy improves when all the messages without peeling off any components are compressed and sent to the receiver. It also verifies that the inner bound based on compress-and-forward strategy is better than that based on decode-and-forward strategy, when the relay node is near to the sink node. Moreover, the rate region of the broadcast channel improves considerably when the collaboration between the two receivers is allowed. So the relay node can provide residual resources to help the communication between the source and the sink after its communication rate is satisfied, which gives some insights to select an available relay node in a practical communication system.

DOI: https://doi.org/10.1515/cait-2015-0031 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 97 - 110
Published on: Jul 3, 2015
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2015 Xiaoxia Song, Yong Li, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.