Multiple description coding based compress-and-forward for the broadcast relay channel

Abstract

In this work, the broadcast relay channel (BRC) with one source, two destinations and a dedicated relay node is studied for both discrete memoryless and Gaussian channels. Unlike all the existing achievability schemes, which use decode-and-forward (DF) relaying for the BRC, the new achievability schemes are based on compress-and-forward (CF). Three different compression methods are proposed: naive, joint and multiple description coding based. In naive CF (nCF) and joint CF (jCF), the relay forms a single representation, conveying its observation to both destinations at a single quality level. On the other hand, in multiple description coding based CF (mdCF), the relay utilizes multiple description coding and forms two representations, which allows for the two destinations to receive the relay observation at different quality levels. Through Gaussian examples, it is observed that mdCF enlarges nCF and jCF rate regions. Moreover, mdCF is the only scheme, which can achieve both of the single user CF rates achievable in the constituent single user relay channels.