Please use this identifier to cite or link to this item:
Title: On achievable rates for the general relay channel
Authors: Chong, H.-F. 
Motani, M. 
Keywords: Backward decoding
mixed strategy
relay channel
sliding-window decoding
Issue Date: Mar-2011
Citation: Chong, H.-F., Motani, M. (2011-03). On achievable rates for the general relay channel. IEEE Transactions on Information Theory 57 (3) : 1249-1266. ScholarBank@NUS Repository.
Abstract: In this paper, we present results on the equivalence of some coding strategies for the general relay channel. Cover & El Gamal described two basic coding strategies for the relay channel, more commonly known as decode-and-forward and compress-and-forward. These two strategies were combined in a mixed strategy that employed irregular encoding and successive forward decoding to give a tighter lower bound for the capacity of the general relay channel. Recently, the authors presented two different mixed strategies, SeqBack decoding and SimBack decoding, that make use of regular encoding and backward decoding. We identify a termination problem in SeqBack/SimBack decoding and present a simple fix. Next, we compare the rates achievable with the various mixed strategies. We first show that SeqBack decoding and SimBack decoding achieve the same rate. We then present alternative characterizations, without feasibility constraints, for the rates achievable with the various mixed strategies. Comparing the alternative characterizations, we note that the rate of SeqBack/SimBack decoding contains the rate of Cover & El Gamal's mixed strategy since there is a more relaxed inequality in the rate expression. We also prove that simultaneously decoding all unknown quantities in each block at the receiver does not increase the achievable rate for backward decoding. Hence, successive decoding in each block proves to be just as effective as simultaneous decoding. Finally, we present a sliding-window decoding strategy that achieves the same rate as SeqBack/SimBack decoding. The sliding-window decoding strategy also avoids the aforementioned termination problem as the receiver commences decoding after three block decoding delay. © 2011 IEEE.
Source Title: IEEE Transactions on Information Theory
ISSN: 00189448
DOI: 10.1109/TIT.2011.2104473
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Nov 30, 2020


checked on Nov 30, 2020

Page view(s)

checked on Dec 1, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.