Please use this identifier to cite or link to this item:
|Title:||Generalized backward decoding strategies for the relay channel||Authors:||Chong, H.-F.
|Issue Date:||Jan-2007||Citation:||Chong, H.-F., Motani, M., Garg, H.K. (2007-01). Generalized backward decoding strategies for the relay channel. IEEE Transactions on Information Theory 53 (1) : 394-401. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2006.887067||Abstract:||This correspondence studies coding strategies for a three-node relay channel. We start with the basic coding strategies of Cover and El Gamal: the relay decodes the source message and forward it to the destination (cooperation); the relay transmits its compressed channel outputs to the destination (facilitation); or the relay superimposes both cooperation and facilitation (generalized). In this paper, two new generalized strategies superimposing cooperation and facilitation are introduced and investigated on the general relay channel. The first strategy makes use of sequential backward (SeqBack) decoding while the second strategy makes use of simultaneous backward (SimBack) decoding. The achievable rate for the second strategy is shown to include that of the generalized strategy of Cover and El Gamal. Assuming zero-mean, jointly Gaussian random variables, the two new strategies give higher achievable rates than the generalized strategy of Cover and El Gamal for certain parameters on the Gaussian relay channel. © 2007 IEEE.||Source Title:||IEEE Transactions on Information Theory||URI:||http://scholarbank.nus.edu.sg/handle/10635/56119||ISSN:||00189448||DOI:||10.1109/TIT.2006.887067|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.