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žené v:
Podrobná bibliografia
Vydané v:2009 IEEE Information Theory Workshop on Networking and Information Theory s. 181 - 185
Hlavní autori: Vaze, R., Heath, R.W.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2009
Predmet:
AWGN
Digital relays
Downlink
Heat engines
Iterative algorithms
Minimization methods
Network coding
Resistance heating
Upper bound
Wireless communication
ISBN:1424445353, 9781424445356
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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.
AbstractList 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.
Author Vaze, R.
Heath, R.W.
Author_xml – sequence: 1
  givenname: R.
  surname: Vaze
  fullname: Vaze, R.
  organization: Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA
– sequence: 2
  givenname: R.W.
  surname: Heath
  fullname: Heath, R.W.
  organization: Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA
BookMark eNo1UNtOwkAQXaMkWuQLeNkfKO798miICgmRBzE-ku12VmqW0rRrmv69JeA8zORc5iQzGbqrTzUgNKdkQSmxT-vd1_t6t2CE2IWk0kilb9DMakMFE0JIrvgtyv6B5BOUnb2WcEP0PZp13Q8ZS46bmj6gj22TqqOL2B2bWIUBu7rE4dT2ri1xl1qX4Hs4Ezj1p7x3A24hjt0fXF1DxH2VDvj4G1PVRLho3SOaBBc7mF3nFH2-vuyWq3yzfVsvnzd5RbVMuQlC8MIqH0ShmZIahLECrNPgfcnAKxKkYEp7bU3JA_NgCB9trFDOsIJP0fySWwHAvmnHO9phf30K_wNflFao
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ITWNIT.2009.5158567
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781424445363
1424445361
EndPage 185
ExternalDocumentID 5158567
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i175t-8f443b96cf4b72657e4894e9a7eccd2ec60f54267c798d3f2ce80357e2b6a82b3
IEDL.DBID RIE
ISBN 1424445353
9781424445356
ISICitedReferencesCount 39
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000273966100039&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:04:36 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2009903807
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-8f443b96cf4b72657e4894e9a7eccd2ec60f54267c798d3f2ce80357e2b6a82b3
PageCount 5
ParticipantIDs ieee_primary_5158567
PublicationCentury 2000
PublicationDate 2009-June
PublicationDateYYYYMMDD 2009-06-01
PublicationDate_xml – month: 06
  year: 2009
  text: 2009-June
PublicationDecade 2000
PublicationTitle 2009 IEEE Information Theory Workshop on Networking and Information Theory
PublicationTitleAbbrev ITWNIT
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558571
Score 1.6025589
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 181
SubjectTerms AWGN
Digital relays
Downlink
Heat engines
Iterative algorithms
Minimization methods
Network coding
Resistance heating
Upper bound
Wireless communication
Title Optimal amplify and forward strategy for two-way relay channel with multiple relays
URI https://ieeexplore.ieee.org/document/5158567
WOSCitedRecordID wos000273966100039&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6tePCk0opvcvBo7G6SzeMsFnupBSv2VvKYhULdSh-W_fcmu9uK4MVbXoQwgZnJZL5vELpTAEHt25SAdYzwVFmivU6JUzq8n51nypiq2IQcDtVkokctdL_HwgBAlXwGD7FZ_eX7hdvEUFkv2F6VCdlGbSlFjdXax1OSLMzJdIfd4hnL2I7SqemLhnUoTXRvMH4fDsY1X2Wz7a_6KpV56R__72AnqPuD08OjvQU6RS0oOuj1JWiBDzPHJiaL5yU2hcfBNY3psXhVk9GWcQCvtwuyNSWOeJYSRwhwAXMcI7N4l2dYz6266K3_NH58Jk3pBDIL_sCaqJxzZrVwObeSikwCV5qDNjJcmafgRJJnwThLJ7XyLKcOVMLCMmqFUdSyM3RQLAo4Rzi8yQQ3njltDbfUKU8N1Z6yzGuphbpAnSiQ6WfNjjFtZHH59_AVOqr_Y2Ic4xodrJcbuEGH7ms9Wy1vqyv9BlhUn3w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61CnpSacW3OXg0tptkN8lZLC3WteCKvZW8Fgp1K-3Wsv_eZHdbEbx4y4sQJjAzmcz3DQC33Fqn9lWArNIE0YArJIwIkObCvZ-1IVzKstgEi2M-HotRA9xtsTDW2jL5zN77ZvmXb-Z65UNlHWd7eRixHbDrK2fVaK1tRKUbulkWbNBbNCQh2ZA61f2o5h0KuqIzSN7jQVIxVtYb_6qwUhqY3uH_jnYE2j9IPTja2qBj0LBZC7y-OD3wIWdQ-nTxtIAyM9A5pz5BFi4rOtrCD8B8PUdrWUCPaCmgBwFndgZ9bBZuMg2ruWUbvPUek4c-qosnoKnzCHLEU0qJEpFOqWI4CpmlXFArJHOXZrDVUTcNnXlmmgluSIq15V3ilmEVSY4VOQHNbJ7ZUwDdqyyi0hAtlKQKa26wxMJgEhrBRMTPQMsLZPJZ8WNMalmc_z18A_b7yfNwMhzETxfgoPqd8VGNS9DMFyt7Bfb0Vz5dLq7L6_0G2o6ixQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+IEEE+Information+Theory+Workshop+on+Networking+and+Information+Theory&rft.atitle=Optimal+amplify+and+forward+strategy+for+two-way+relay+channel+with+multiple+relays&rft.au=Vaze%2C+R.&rft.au=Heath%2C+R.W.&rft.date=2009-06-01&rft.pub=IEEE&rft.isbn=9781424445356&rft.spage=181&rft.epage=185&rft_id=info:doi/10.1109%2FITWNIT.2009.5158567&rft.externalDocID=5158567
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424445356/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424445356/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424445356/sc.gif&client=summon&freeimage=true