Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays

We consider a multi-pair two-way relay network with multiple single antenna amplify-and-forward relays. The sum rate maximization problem subject to a total transmit power constraint is studied for such network. The optimization problem is non-convex. First, we show that the problem is a monotonic o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jianshu Zhang, Roemer, F., Haardt, M., Khabbazibasmenj, A., Vorobyov, S. A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2480
container_issue
container_start_page 2477
container_title
container_volume
creator Jianshu Zhang
Roemer, F.
Haardt, M.
Khabbazibasmenj, A.
Vorobyov, S. A.
description We consider a multi-pair two-way relay network with multiple single antenna amplify-and-forward relays. The sum rate maximization problem subject to a total transmit power constraint is studied for such network. The optimization problem is non-convex. First, we show that the problem is a monotonic optimization problem and propose a polyblock approximation algorithm for obtaining the global optimum. However, this algorithm is only suitable for benchmarking because of its high computational complexity. After observing that the necessary optimality condition for our problem is similar to that of the generalized eigenvalue problem, we propose to use the generalized power iterative algorithm which can approach the global optimum recursively. Finally, we propose the total signal-to-interference-plus-noise ratio (SINR) eigen-beamformer which is a closed-form suboptimal solution that reduces the computational complexity significantly. Simulation results show that the proposed algorithms outperform the existing scheme. Moreover, the total SINR eigen-beamformer almost achieves the performance of the optimal solution.
doi_str_mv 10.1109/ICASSP.2012.6288418
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6288418</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6288418</ieee_id><sourcerecordid>6288418</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-eaee866d27d1cff47040b1cd15aa1a00110eae653c7535e331b1ec4dfc98df7a3</originalsourceid><addsrcrecordid>eNo1kFtLw0AQhdcbGGt_QV_2D2zdyd6yj1K8QUGhCr6VaXZXV5K0JFti_PVGWs_LHDjzDcwhZAZ8DsDtzdPidrV6mecc8rnOi0JCcUKm1hQgtRGcS21PSZYLYxlY_n5Grv4DJc9JBirnTIO0l2TadV981IhyoTPiVvuatpg8rfE71vEHU9w2NGxbWu-rFNkOY0tTv2U9DrT1FQ6x-aB9TJ-0G13lGTbJNw1SrHdVDAPFxv3xPbbuAHTX5CJg1fnpcU7I2_3d6-KRLZ8fxteWLIJRiXn0vtDa5cZBGYI0XPINlA4UIiDnYxXjilaiNEooLwRswJfShdIWLhgUEzI73I3e-_WujTW2w_pYmPgFanZdpA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jianshu Zhang ; Roemer, F. ; Haardt, M. ; Khabbazibasmenj, A. ; Vorobyov, S. A.</creator><creatorcontrib>Jianshu Zhang ; Roemer, F. ; Haardt, M. ; Khabbazibasmenj, A. ; Vorobyov, S. A.</creatorcontrib><description>We consider a multi-pair two-way relay network with multiple single antenna amplify-and-forward relays. The sum rate maximization problem subject to a total transmit power constraint is studied for such network. The optimization problem is non-convex. First, we show that the problem is a monotonic optimization problem and propose a polyblock approximation algorithm for obtaining the global optimum. However, this algorithm is only suitable for benchmarking because of its high computational complexity. After observing that the necessary optimality condition for our problem is similar to that of the generalized eigenvalue problem, we propose to use the generalized power iterative algorithm which can approach the global optimum recursively. Finally, we propose the total signal-to-interference-plus-noise ratio (SINR) eigen-beamformer which is a closed-form suboptimal solution that reduces the computational complexity significantly. Simulation results show that the proposed algorithms outperform the existing scheme. Moreover, the total SINR eigen-beamformer almost achieves the performance of the optimal solution.</description><identifier>ISSN: 1520-6149</identifier><identifier>ISBN: 1467300454</identifier><identifier>ISBN: 9781467300452</identifier><identifier>EISSN: 2379-190X</identifier><identifier>EISBN: 9781467300469</identifier><identifier>EISBN: 1467300446</identifier><identifier>EISBN: 9781467300445</identifier><identifier>EISBN: 1467300462</identifier><identifier>DOI: 10.1109/ICASSP.2012.6288418</identifier><language>eng</language><publisher>IEEE</publisher><subject>amplify and forward ; Approximation algorithms ; Approximation methods ; Eigenvalues and eigenfunctions ; Interference ; monotonic optimization ; Optimization ; Relays ; Signal to noise ratio ; sum rate maximization ; Two-way relaying</subject><ispartof>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012, p.2477-2480</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6288418$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6288418$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jianshu Zhang</creatorcontrib><creatorcontrib>Roemer, F.</creatorcontrib><creatorcontrib>Haardt, M.</creatorcontrib><creatorcontrib>Khabbazibasmenj, A.</creatorcontrib><creatorcontrib>Vorobyov, S. A.</creatorcontrib><title>Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays</title><title>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</title><addtitle>ICASSP</addtitle><description>We consider a multi-pair two-way relay network with multiple single antenna amplify-and-forward relays. The sum rate maximization problem subject to a total transmit power constraint is studied for such network. The optimization problem is non-convex. First, we show that the problem is a monotonic optimization problem and propose a polyblock approximation algorithm for obtaining the global optimum. However, this algorithm is only suitable for benchmarking because of its high computational complexity. After observing that the necessary optimality condition for our problem is similar to that of the generalized eigenvalue problem, we propose to use the generalized power iterative algorithm which can approach the global optimum recursively. Finally, we propose the total signal-to-interference-plus-noise ratio (SINR) eigen-beamformer which is a closed-form suboptimal solution that reduces the computational complexity significantly. Simulation results show that the proposed algorithms outperform the existing scheme. Moreover, the total SINR eigen-beamformer almost achieves the performance of the optimal solution.</description><subject>amplify and forward</subject><subject>Approximation algorithms</subject><subject>Approximation methods</subject><subject>Eigenvalues and eigenfunctions</subject><subject>Interference</subject><subject>monotonic optimization</subject><subject>Optimization</subject><subject>Relays</subject><subject>Signal to noise ratio</subject><subject>sum rate maximization</subject><subject>Two-way relaying</subject><issn>1520-6149</issn><issn>2379-190X</issn><isbn>1467300454</isbn><isbn>9781467300452</isbn><isbn>9781467300469</isbn><isbn>1467300446</isbn><isbn>9781467300445</isbn><isbn>1467300462</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kFtLw0AQhdcbGGt_QV_2D2zdyd6yj1K8QUGhCr6VaXZXV5K0JFti_PVGWs_LHDjzDcwhZAZ8DsDtzdPidrV6mecc8rnOi0JCcUKm1hQgtRGcS21PSZYLYxlY_n5Grv4DJc9JBirnTIO0l2TadV981IhyoTPiVvuatpg8rfE71vEHU9w2NGxbWu-rFNkOY0tTv2U9DrT1FQ6x-aB9TJ-0G13lGTbJNw1SrHdVDAPFxv3xPbbuAHTX5CJg1fnpcU7I2_3d6-KRLZ8fxteWLIJRiXn0vtDa5cZBGYI0XPINlA4UIiDnYxXjilaiNEooLwRswJfShdIWLhgUEzI73I3e-_WujTW2w_pYmPgFanZdpA</recordid><startdate>201203</startdate><enddate>201203</enddate><creator>Jianshu Zhang</creator><creator>Roemer, F.</creator><creator>Haardt, M.</creator><creator>Khabbazibasmenj, A.</creator><creator>Vorobyov, S. A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201203</creationdate><title>Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays</title><author>Jianshu Zhang ; Roemer, F. ; Haardt, M. ; Khabbazibasmenj, A. ; Vorobyov, S. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-eaee866d27d1cff47040b1cd15aa1a00110eae653c7535e331b1ec4dfc98df7a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>amplify and forward</topic><topic>Approximation algorithms</topic><topic>Approximation methods</topic><topic>Eigenvalues and eigenfunctions</topic><topic>Interference</topic><topic>monotonic optimization</topic><topic>Optimization</topic><topic>Relays</topic><topic>Signal to noise ratio</topic><topic>sum rate maximization</topic><topic>Two-way relaying</topic><toplevel>online_resources</toplevel><creatorcontrib>Jianshu Zhang</creatorcontrib><creatorcontrib>Roemer, F.</creatorcontrib><creatorcontrib>Haardt, M.</creatorcontrib><creatorcontrib>Khabbazibasmenj, A.</creatorcontrib><creatorcontrib>Vorobyov, S. A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jianshu Zhang</au><au>Roemer, F.</au><au>Haardt, M.</au><au>Khabbazibasmenj, A.</au><au>Vorobyov, S. A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays</atitle><btitle>2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</btitle><stitle>ICASSP</stitle><date>2012-03</date><risdate>2012</risdate><spage>2477</spage><epage>2480</epage><pages>2477-2480</pages><issn>1520-6149</issn><eissn>2379-190X</eissn><isbn>1467300454</isbn><isbn>9781467300452</isbn><eisbn>9781467300469</eisbn><eisbn>1467300446</eisbn><eisbn>9781467300445</eisbn><eisbn>1467300462</eisbn><abstract>We consider a multi-pair two-way relay network with multiple single antenna amplify-and-forward relays. The sum rate maximization problem subject to a total transmit power constraint is studied for such network. The optimization problem is non-convex. First, we show that the problem is a monotonic optimization problem and propose a polyblock approximation algorithm for obtaining the global optimum. However, this algorithm is only suitable for benchmarking because of its high computational complexity. After observing that the necessary optimality condition for our problem is similar to that of the generalized eigenvalue problem, we propose to use the generalized power iterative algorithm which can approach the global optimum recursively. Finally, we propose the total signal-to-interference-plus-noise ratio (SINR) eigen-beamformer which is a closed-form suboptimal solution that reduces the computational complexity significantly. Simulation results show that the proposed algorithms outperform the existing scheme. Moreover, the total SINR eigen-beamformer almost achieves the performance of the optimal solution.</abstract><pub>IEEE</pub><doi>10.1109/ICASSP.2012.6288418</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1520-6149
ispartof 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012, p.2477-2480
issn 1520-6149
2379-190X
language eng
recordid cdi_ieee_primary_6288418
source IEEE Electronic Library (IEL) Conference Proceedings
subjects amplify and forward
Approximation algorithms
Approximation methods
Eigenvalues and eigenfunctions
Interference
monotonic optimization
Optimization
Relays
Signal to noise ratio
sum rate maximization
Two-way relaying
title Sum rate maximization for multi-pair two-way relaying with single-antenna amplify and forward relays
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T00%3A15%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Sum%20rate%20maximization%20for%20multi-pair%20two-way%20relaying%20with%20single-antenna%20amplify%20and%20forward%20relays&rft.btitle=2012%20IEEE%20International%20Conference%20on%20Acoustics,%20Speech%20and%20Signal%20Processing%20(ICASSP)&rft.au=Jianshu%20Zhang&rft.date=2012-03&rft.spage=2477&rft.epage=2480&rft.pages=2477-2480&rft.issn=1520-6149&rft.eissn=2379-190X&rft.isbn=1467300454&rft.isbn_list=9781467300452&rft_id=info:doi/10.1109/ICASSP.2012.6288418&rft_dat=%3Cieee_6IE%3E6288418%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467300469&rft.eisbn_list=1467300446&rft.eisbn_list=9781467300445&rft.eisbn_list=1467300462&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6288418&rfr_iscdi=true