Optimal amplify and forward strategy for two-way relay channel with multiple relays

An iterative algorithm is proposed to achieve the optimal rate region in a two-way relay channel, where two nodes want to exchange data with each other using multiple relays, and each relay employs an amplify and forward strategy. The iterative algorithm solves a power minimization problem at every...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 181 - 185
Main Authors Vaze, R., Heath, R.W.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
AWGN
Digital relays
Downlink
Heat engines
Iterative algorithms
Minimization methods
Network coding
Resistance heating
Upper bound
Wireless communication
Online AccessGet full text
ISBN1424445353
9781424445356
DOI10.1109/ITWNIT.2009.5158567

Cover

More Information
Summary:An iterative algorithm is proposed to achieve the optimal rate region in a two-way relay channel, where two nodes want to exchange data with each other using multiple relays, and each relay employs an amplify and forward strategy. The iterative algorithm solves a power minimization problem at every step, subject to minimum signal-to-interference-and-noise ratio constraints, which is non-convex, however, for which the Karush Kuhn Tucker conditions are sufficient for optimality. Using simulations, the achievable rate region of the iterative algorithm is compared with the cut-set upper bound; the gap is shown to be quite small for most cases.
ISBN:1424445353
9781424445356
DOI:10.1109/ITWNIT.2009.5158567