Capacity bounds and mapping design for binary symmetric relay channels
2012 (English)In: Entropy, ISSN 1099-4300, Vol. 14, no 12, 2589-2610 p.Article in journal (Refereed) Published
Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF), partial DF and compress-and-forward (CF) relaying are first evaluated. Then relaying strategies with finite memory-length are considered. An efficient algorithm for optimizing the relay functions is presented.The Boolean Fourier transform is then employed to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. Numerical results illustrate that the rates achieved using the optimized low-dimensional functions are either comparable to those achieved by CF orsuperior to those achieved by DF relaying.In particular, the optimized low-dimensional relaying scheme can improve on DF relaying when the quality of the source-relay link is worse than or comparable to that of other links.
Place, publisher, year, edition, pages
2012. Vol. 14, no 12, 2589-2610 p.
Binary fourier transform, Binary symmetric relay channel, Capacity bounds, Compress-and-forward, Decode-and-forward, Linear relaying
IdentifiersURN: urn:nbn:se:kth:diva-115483DOI: 10.3390/e14122589ISI: 000312606300013ScopusID: 2-s2.0-84871602365OAI: oai:DiVA.org:kth-115483DiVA: diva2:588791
FunderSwedish Research Council
QC 201301162013-01-162013-01-152013-01-21Bibliographically approved