On rate regions for broadcast relay channels

Dong, Yunquan; Fan, Pingyi

doi:10.1109/icct.2011.6158022

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To show the fundamental limits of such a relay-aided downlink system, in the literature [23–27], there are a lot of studies on characterizing the achievable rates for the channel where one BS transmits data packets to multiple MSs with the help of one RS (termed the broadcast relay channel). The schemes in [23–27] use either DF relaying [23–27] or compress-and-forward relaying [23, 26]. However, so as to obtain relatively high sum-rates approaching the system capacity, they were designed based on the use of rather complex nonlinear processing (i.e., a superposition coding at the BS and a successive or joint decoding at the receiver sides).…”

Section: Introductionmentioning

confidence: 99%

On the Multiuser Diversity of Relay-Aided Downlink Systems Using Reduced Feedback

Jang

Shin

2014

The Scientific World Journal

View full text Add to dashboard Cite

We introduce an efficient multiuser scheduling method using amplify-and-forward relaying in relay-aided downlink systems, consisting of one base station (BS), one relay station, and multiple mobile stations (MSs). In our scheme, the BS opportunistically selects both the transmission mode, that is, either one- or two-hop transmission, and the desired user (i.e., the desired MS). Closed-form expressions for the average achievable rates are derived for the two transmission modes with multiuser scheduling, and its asymptotic solutions are also analyzed in the limit of large number of MSs. Based on the analysis, we propose a feedback-efficient two-step multiuser scheduling algorithm: the transmission mode selection followed by the user selection that only needs a partial feedback for instantaneous signal-to-noise ratios (SNRs) to the BS. We also analyze the average SNR condition such that the multiuser diversity gain is fully exploited for two-hop transmission. The proposed two-step scheduling algorithm exhibits the quite comparable achievable rates to those of the optimal one using full feedback information, while its required feedback information is reduced by half of the optimal one.

show abstract