Memoryless relay strategies for two-way relay channels
- Creators
- Cui, Tao
- Ho, Tracey
- Kliewer, Jörg
Abstract
We propose relaying strategies for uncoded two-way relay channels, where two terminals transmit simultaneously to each other with the help of a relay. In particular, we consider a memoryless system, where the signal transmitted by the relay is obtained by applying an instantaneous relay function to the previously received signal. For binary antipodal signaling, a class of so called absolute (abs)-based schemes is proposed in which the processing at the relay is solely based on the absolute value of the received signal. We analyze and optimize the symbol-error performance of existing and new abs-based and non-abs-based strategies under an average power constraint, including abs-based and non-abs-based versions of amplify and forward (AF), detect and forward (DF), and estimate and forward (EF). Additionally, we optimize the relay function via functional analysis such that the average probability of error is minimized at the high signal-to-noise ratio (SNR) regime. The optimized relay function is shown to be a Lambert W function parameterized on the noise power and the transmission energy. The optimized function behaves like abs-AF at low SNR and like abs-DF at high SNR, respectively; EF behaves similarly to the optimized function over the whole SNR range. We find the conditions under which each class of strategies is preferred. Finally, we show that all these results can also be generalized to higher order constellations.
Additional Information
© 2009 IEEE. Paper approved by G.-H. Im, the Editor for Equalization and Multicarrier Techniques of the IEEE Communications Society. Manuscript received April 28, 2008; revised October 12, 2008 and December 24, 2008. This work has been supported in part by DARPA grant N66001-06-C-2020, Caltechs Lee Center for Advanced Networking, the Okawa Foundation Research Grant, NSF grant CCF-0830666, and a gift from Microsoft Research. This paper has been presented in part at the IEEE International Conference on Communications, May 2008, Beijing, China [1], and in part at the Information Theory and Applications Workshop, Jan. 2008, San Diego, CA, USA.Attached Files
Published - Cui2009p6213Ieee_T_Commun.pdf
Files
Name | Size | Download all |
---|---|---|
md5:033c9da9610b59447f22ef4cd7063025
|
503.6 kB | Preview Download |
Additional details
- Eprint ID
- 16583
- Resolver ID
- CaltechAUTHORS:20091104-153456802
- Defense Advanced Research Projects Agency (DARPA)
- N66001-06-C-2020
- Caltech Lee Center for Advanced Networking
- Okawa Foundation Research Grant
- NSF
- CCF-0830666
- Microsoft Research
- Created
-
2009-11-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field