Optimized mappings for dimension-expansion relaying
2009 (English)In: SPAWC: 2009 IEEE 10TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, NEW YORK: IEEE , 2009, 474-478 p.Conference paper (Refereed)
We study the three-node Gaussian relay channel consisting of a source, a relay and a destination. We assume that the relay is memoryless, i.e., the transmitted signal from the relay depends only on the currently received signal. Additionally, we focus on dimension expansion relaying, where the relay has access to more channel uses for retransmission. We use the end-to-end mutual information to numerically optimize the relay mappings. We present several examples for two types of source input alphabets: continuous (Gaussian and uniform) and discrete (uniform PAM). The maximum rate attained by using the optimized mappings is considerably improved compared to conventional linear relaying.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 474-478 p.
CAPACITY THEOREMS, NETWORKS, CHANNEL
IdentifiersURN: urn:nbn:se:kth:diva-28941DOI: 10.1109/SPAWC.2009.5161830ISI: 000274650700096ScopusID: 2-s2.0-70449587113ISBN: 978-1-4244-3695-8OAI: oai:DiVA.org:kth-28941DiVA: diva2:399597
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