Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization
Block diagonalization (BD) is a precoding technique that eliminates interuser interference in downlink multiuser multiple-input multiple-output (MIMO) systems. With the assumptions that all users have the same number of receive antennas and utilize all receive antennas when scheduled for transmissio...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on signal processing 2006-09, Vol.54 (9), p.3658-3663 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 3663 |
|---|---|
| container_issue | 9 |
| container_start_page | 3658 |
| container_title | IEEE transactions on signal processing |
| container_volume | 54 |
| creator | Zukang Shen Runhua Chen Andrews, J.G. Heath, R.W. Evans, B.L. |
| description | Block diagonalization (BD) is a precoding technique that eliminates interuser interference in downlink multiuser multiple-input multiple-output (MIMO) systems. With the assumptions that all users have the same number of receive antennas and utilize all receive antennas when scheduled for transmission, the number of simultaneously supportable users with BD is limited by the ratio of the number of base station transmit antennas to the number of user receive antennas. In a downlink MIMO system with a large number of users, the base station may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose two low-complexity suboptimal user selection algorithms for multiuser MIMO systems with BD. Both algorithms aim to select a subset of users such that the total throughput is nearly maximized. The first user selection algorithm greedily maximizes the total throughput, whereas the criterion of the second algorithm is based on the channel energy. We show that both algorithms have linear complexity in the total number of users and achieve around 95% of the total throughput of the complete search method in simulations |
| doi_str_mv | 10.1109/TSP.2006.879269 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_896182272</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1677932</ieee_id><sourcerecordid>896182272</sourcerecordid><originalsourceid>FETCH-LOGICAL-c350t-383e61840778e173a1809a4c2b1b13e94029cf7bf7e5d8c49cff8a72b27e7b983</originalsourceid><addsrcrecordid>eNpd0EtLAzEUBeBBFKyPtQs3QRBXU_OaSbIU8VGoVLCCK4dMvKOpmaYmM2j99aZWKLhKwv3uIZwsOyJ4SAhW59OH-yHFuBxKoWiptrIBUZzkmItyO91xwfJCiqfdbC_GGcaEc1UOsuex_0TGtwsHX7Zboj5CQBEcmM76OdLu1QfbvbURNT6gtned_SV3o7sJisvYQRp9JoFq5807erH61c-1s996FXCQ7TTaRTj8O_ezx-ur6eVtPp7cjC4vxrlhBe5yJhmURHIshAQimCYSK80NrUlNGCiOqTKNqBsBxYs0PD0aqQWtqQBRK8n2s7N17iL4jx5iV7U2GnBOz8H3sZIqxVMqaJIn_-TM9yH9OKGyFISqQiR0vkYm-BgDNNUi2FaHZUVwtWq7Sm1Xq7arddtp4_QvVkejXRP03Ni4WZOYU4VJcsdrZwFgMy6FUIyyH7y5iPE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>866712957</pqid></control><display><type>article</type><title>Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization</title><source>IEEE Electronic Library (IEL)</source><creator>Zukang Shen ; Runhua Chen ; Andrews, J.G. ; Heath, R.W. ; Evans, B.L.</creator><creatorcontrib>Zukang Shen ; Runhua Chen ; Andrews, J.G. ; Heath, R.W. ; Evans, B.L.</creatorcontrib><description>Block diagonalization (BD) is a precoding technique that eliminates interuser interference in downlink multiuser multiple-input multiple-output (MIMO) systems. With the assumptions that all users have the same number of receive antennas and utilize all receive antennas when scheduled for transmission, the number of simultaneously supportable users with BD is limited by the ratio of the number of base station transmit antennas to the number of user receive antennas. In a downlink MIMO system with a large number of users, the base station may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose two low-complexity suboptimal user selection algorithms for multiuser MIMO systems with BD. Both algorithms aim to select a subset of users such that the total throughput is nearly maximized. The first user selection algorithm greedily maximizes the total throughput, whereas the criterion of the second algorithm is based on the channel energy. We show that both algorithms have linear complexity in the total number of users and achieve around 95% of the total throughput of the complete search method in simulations</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/TSP.2006.879269</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Antennas ; Applied sciences ; Base stations ; Blocking ; Broadcasting ; Channel capacity ; Channels ; Complexity ; Covariance matrix ; Detection, estimation, filtering, equalization, prediction ; Downlink ; Energy use ; Exact sciences and technology ; Frobenius norm ; Information, signal and communications theory ; MIMO ; Miscellaneous ; multiple-input multiple-output (MIMO) ; multiuser ; Null space ; Optimization ; Receiving antennas ; Signal and communications theory ; Signal processing ; Signal, noise ; Stations ; Studies ; sum capacity ; Telecommunications and information theory ; Throughput ; Transmitting antennas</subject><ispartof>IEEE transactions on signal processing, 2006-09, Vol.54 (9), p.3658-3663</ispartof><rights>2006 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c350t-383e61840778e173a1809a4c2b1b13e94029cf7bf7e5d8c49cff8a72b27e7b983</citedby><cites>FETCH-LOGICAL-c350t-383e61840778e173a1809a4c2b1b13e94029cf7bf7e5d8c49cff8a72b27e7b983</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1677932$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1677932$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18042901$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Zukang Shen</creatorcontrib><creatorcontrib>Runhua Chen</creatorcontrib><creatorcontrib>Andrews, J.G.</creatorcontrib><creatorcontrib>Heath, R.W.</creatorcontrib><creatorcontrib>Evans, B.L.</creatorcontrib><title>Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>Block diagonalization (BD) is a precoding technique that eliminates interuser interference in downlink multiuser multiple-input multiple-output (MIMO) systems. With the assumptions that all users have the same number of receive antennas and utilize all receive antennas when scheduled for transmission, the number of simultaneously supportable users with BD is limited by the ratio of the number of base station transmit antennas to the number of user receive antennas. In a downlink MIMO system with a large number of users, the base station may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose two low-complexity suboptimal user selection algorithms for multiuser MIMO systems with BD. Both algorithms aim to select a subset of users such that the total throughput is nearly maximized. The first user selection algorithm greedily maximizes the total throughput, whereas the criterion of the second algorithm is based on the channel energy. We show that both algorithms have linear complexity in the total number of users and achieve around 95% of the total throughput of the complete search method in simulations</description><subject>Algorithms</subject><subject>Antennas</subject><subject>Applied sciences</subject><subject>Base stations</subject><subject>Blocking</subject><subject>Broadcasting</subject><subject>Channel capacity</subject><subject>Channels</subject><subject>Complexity</subject><subject>Covariance matrix</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Downlink</subject><subject>Energy use</subject><subject>Exact sciences and technology</subject><subject>Frobenius norm</subject><subject>Information, signal and communications theory</subject><subject>MIMO</subject><subject>Miscellaneous</subject><subject>multiple-input multiple-output (MIMO)</subject><subject>multiuser</subject><subject>Null space</subject><subject>Optimization</subject><subject>Receiving antennas</subject><subject>Signal and communications theory</subject><subject>Signal processing</subject><subject>Signal, noise</subject><subject>Stations</subject><subject>Studies</subject><subject>sum capacity</subject><subject>Telecommunications and information theory</subject><subject>Throughput</subject><subject>Transmitting antennas</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpd0EtLAzEUBeBBFKyPtQs3QRBXU_OaSbIU8VGoVLCCK4dMvKOpmaYmM2j99aZWKLhKwv3uIZwsOyJ4SAhW59OH-yHFuBxKoWiptrIBUZzkmItyO91xwfJCiqfdbC_GGcaEc1UOsuex_0TGtwsHX7Zboj5CQBEcmM76OdLu1QfbvbURNT6gtned_SV3o7sJisvYQRp9JoFq5807erH61c-1s996FXCQ7TTaRTj8O_ezx-ur6eVtPp7cjC4vxrlhBe5yJhmURHIshAQimCYSK80NrUlNGCiOqTKNqBsBxYs0PD0aqQWtqQBRK8n2s7N17iL4jx5iV7U2GnBOz8H3sZIqxVMqaJIn_-TM9yH9OKGyFISqQiR0vkYm-BgDNNUi2FaHZUVwtWq7Sm1Xq7arddtp4_QvVkejXRP03Ni4WZOYU4VJcsdrZwFgMy6FUIyyH7y5iPE</recordid><startdate>20060901</startdate><enddate>20060901</enddate><creator>Zukang Shen</creator><creator>Runhua Chen</creator><creator>Andrews, J.G.</creator><creator>Heath, R.W.</creator><creator>Evans, B.L.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20060901</creationdate><title>Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization</title><author>Zukang Shen ; Runhua Chen ; Andrews, J.G. ; Heath, R.W. ; Evans, B.L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c350t-383e61840778e173a1809a4c2b1b13e94029cf7bf7e5d8c49cff8a72b27e7b983</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Antennas</topic><topic>Applied sciences</topic><topic>Base stations</topic><topic>Blocking</topic><topic>Broadcasting</topic><topic>Channel capacity</topic><topic>Channels</topic><topic>Complexity</topic><topic>Covariance matrix</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Downlink</topic><topic>Energy use</topic><topic>Exact sciences and technology</topic><topic>Frobenius norm</topic><topic>Information, signal and communications theory</topic><topic>MIMO</topic><topic>Miscellaneous</topic><topic>multiple-input multiple-output (MIMO)</topic><topic>multiuser</topic><topic>Null space</topic><topic>Optimization</topic><topic>Receiving antennas</topic><topic>Signal and communications theory</topic><topic>Signal processing</topic><topic>Signal, noise</topic><topic>Stations</topic><topic>Studies</topic><topic>sum capacity</topic><topic>Telecommunications and information theory</topic><topic>Throughput</topic><topic>Transmitting antennas</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zukang Shen</creatorcontrib><creatorcontrib>Runhua Chen</creatorcontrib><creatorcontrib>Andrews, J.G.</creatorcontrib><creatorcontrib>Heath, R.W.</creatorcontrib><creatorcontrib>Evans, B.L.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zukang Shen</au><au>Runhua Chen</au><au>Andrews, J.G.</au><au>Heath, R.W.</au><au>Evans, B.L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>2006-09-01</date><risdate>2006</risdate><volume>54</volume><issue>9</issue><spage>3658</spage><epage>3663</epage><pages>3658-3663</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract>Block diagonalization (BD) is a precoding technique that eliminates interuser interference in downlink multiuser multiple-input multiple-output (MIMO) systems. With the assumptions that all users have the same number of receive antennas and utilize all receive antennas when scheduled for transmission, the number of simultaneously supportable users with BD is limited by the ratio of the number of base station transmit antennas to the number of user receive antennas. In a downlink MIMO system with a large number of users, the base station may select a subset of users to serve in order to maximize the total throughput. The brute-force search for the optimal user set, however, is computationally prohibitive. We propose two low-complexity suboptimal user selection algorithms for multiuser MIMO systems with BD. Both algorithms aim to select a subset of users such that the total throughput is nearly maximized. The first user selection algorithm greedily maximizes the total throughput, whereas the criterion of the second algorithm is based on the channel energy. We show that both algorithms have linear complexity in the total number of users and achieve around 95% of the total throughput of the complete search method in simulations</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TSP.2006.879269</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1053-587X |
| ispartof | IEEE transactions on signal processing, 2006-09, Vol.54 (9), p.3658-3663 |
| issn | 1053-587X 1941-0476 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_896182272 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Antennas Applied sciences Base stations Blocking Broadcasting Channel capacity Channels Complexity Covariance matrix Detection, estimation, filtering, equalization, prediction Downlink Energy use Exact sciences and technology Frobenius norm Information, signal and communications theory MIMO Miscellaneous multiple-input multiple-output (MIMO) multiuser Null space Optimization Receiving antennas Signal and communications theory Signal processing Signal, noise Stations Studies sum capacity Telecommunications and information theory Throughput Transmitting antennas |
| title | Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T05%3A01%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Low%20complexity%20user%20selection%20algorithms%20for%20multiuser%20MIMO%20systems%20with%20block%20diagonalization&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Zukang%20Shen&rft.date=2006-09-01&rft.volume=54&rft.issue=9&rft.spage=3658&rft.epage=3663&rft.pages=3658-3663&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/TSP.2006.879269&rft_dat=%3Cproquest_RIE%3E896182272%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=866712957&rft_id=info:pmid/&rft_ieee_id=1677932&rfr_iscdi=true |