DocumentCode
2983326
Title
On cooperative downlink transmission with frequency reuse
Author
Khormuji, Majid N. ; Skoglund, Mikael
Author_Institution
ACCESS Linnaeus Center, R. Inst. of Technol. (KTH), Stockholm, Sweden
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
849
Lastpage
853
Abstract
We study a three-node Gaussian relay channel with interference which is non-causally known at the source. It is assumed that the interference affects only the relay-destination link. This model is motivated by a downlink scenario, where the source (base station), communicates with two destinations. We present several transmission strategies for this class of relay channels. Our proposed relaying schemes can be divided into two main categories: instantaneous relaying and causal relaying. In the former, the relay functionality is restricted to a memoryless, symbol-by-symbol mapping (linear as well as non-linear). While in the latter, the relay has an infinite memory and utilizes past received blocks to cooperate in the present block. For causal relaying, we investigate decode-and-forward (DF), compress-and-forward (CF), and combined DF and CF. To utilize the knowledge of the interference at the source, superposition coding at the source and Costa encoding at the relay are employed. One interesting observation is that instantaneous relaying can achieve higher rates than those achieved with causal relaying.
Keywords
Gaussian channels; source coding; telecommunication links; Costa encoding; Gaussian relay channel; causal relaying; compress-and-forward; cooperative downlink transmission; decode-and-forward; frequency reuse; instantaneous relaying; relay channels; relay destination link; source encoding; superposition coding; symbol-by-symbol mapping; Bandwidth; Base stations; Decoding; Downlink; Frequency; Interference; Relays; Robustness; Wireless communication; Zirconium;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205613
Filename
5205613
Link To Document