Exploiting the N-to-1 mapping in compress-and-forward relaying
In this paper, a forward decoding procedure is developed for the compress-and-forward (CF) relaying scheme. This procedure uses a layered framework and is based on exploiting a feature of the N-to-1 mapping inherent in the underlying Wyner-Ziv binning. It is shown that exploiting this mapping enables the relaxation of the constraint on the rate of the relay codewords representing the bin indices. For the cooperative multimessage network, the proposed procedure achieves the same rate region as the short-message noisy network coding (SNNC) scheme. However, this procedure is more advantageous for other networks including the two networks presented herein. The first network is a relay chain one with two destinations, whereas the second network is a partially cooperative multimessage one with three destinations. In both networks, side information is available to a subset of the decoding nodes, but not to the rest of the nodes, and in both cases, the network benefits from the relaxation of the rate of the CF bin indices. This relaxation results in rate regions larger than those achieved by the conventional CF and SNNC.
|Keywords||Compress-and-forward, Layered framework, Partially cooperative multimessage network, Relay chain, Relay channel, Short-message noisy network coding, Side information, Wyner-Ziv binning|
|Journal||IEEE Transactions on Information Theory|
Luo, K. (Kevin), Gohary, R, & Yanikömeroǧlu, H. (2016). Exploiting the N-to-1 mapping in compress-and-forward relaying. IEEE Transactions on Information Theory, 62(1), 290–308. doi:10.1109/TIT.2015.2491941