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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 IEEE Information Theory Workshop on Networking and Information Theory s. 181 - 185
Hlavní autoři: Vaze, R., Heath, R.W.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2009
Témata:
AWGN
Digital relays
Downlink
Heat engines
Iterative algorithms
Minimization methods
Network coding
Resistance heating
Upper bound
Wireless communication
ISBN:1424445353, 9781424445356
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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