Piecewise linear relaying: A low complexity parametric relaying
2009 (English)In: SPAWC: 2009 IEEE 10TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, NEW YORK: IEEE , 2009, 255-259 p.Conference paper (Refereed)
We investigate the Gaussian, three-nodes relay channel with orthogonal receive components, i.e., the transmitted signals from the source and the relay do not interfere with each other. We develop and analyze low-complexity symbol-wise (as opposed to block-wise) relaying strategies based on a one-dimensional, parametric piecewise linear (PL) mapping. We numerically compute and optimize the achievable rates obtained by the PL mapping for a certain number of design parameters. We conclude that optimized PL relaying always outperforms conventional instantaneous linear relaying (amplify-and-forward). We also illustrate that the proposed PL relaying can improve on sophisticated block Markov encoding (i.e., decode-and-forward) when the source-relay link is ill-conditioned (relative to other links). Furthermore, PL relaying can work at rates close to those achieved by side-information encoding (i.e., compress-and-forward), but at a much lower complexity.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 255-259 p.
IdentifiersURN: urn:nbn:se:kth:diva-28939DOI: 10.1109/SPAWC.2009.5161786ISI: 000274650700052ScopusID: 2-s2.0-70449595713ISBN: 978-1-4244-3695-8OAI: oai:DiVA.org:kth-28939DiVA: diva2:399599
10th IEEE Workshop on Signal Processing Advances in Wireless Communications Perugia, ITALY, JUN 21-24, 2009
QC 201102232011-02-232011-01-252011-02-23Bibliographically approved