Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization
Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, ba...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Yuan, Kun [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2016 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Wireless personal communications - Springer US, 1994, 91(2016), 2 vom: 14. Juli, Seite 691-707 |
|---|---|
| Übergeordnetes Werk: |
volume:91 ; year:2016 ; number:2 ; day:14 ; month:07 ; pages:691-707 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11277-016-3488-1 |
|---|
| Katalog-ID: |
OLC2053800348 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2053800348 | ||
| 003 | DE-627 | ||
| 005 | 20230504075230.0 | ||
| 007 | tu | ||
| 008 | 200819s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11277-016-3488-1 |2 doi | |
| 035 | |a (DE-627)OLC2053800348 | ||
| 035 | |a (DE-He213)s11277-016-3488-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 100 | 1 | |a Yuan, Kun |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media New York 2016 | ||
| 520 | |a Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. | ||
| 650 | 4 | |a Block diagonalization | |
| 650 | 4 | |a Downlink system | |
| 650 | 4 | |a -Hausdorff distance | |
| 650 | 4 | |a MU-MIMO | |
| 650 | 4 | |a User selection | |
| 650 | 4 | |a Waterfilling | |
| 700 | 1 | |a Cao, Yewen |4 aut | |
| 700 | 1 | |a Wang, Deqiang |4 aut | |
| 700 | 1 | |a Zhang, Huanjing |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Wireless personal communications |d Springer US, 1994 |g 91(2016), 2 vom: 14. Juli, Seite 691-707 |w (DE-627)188950273 |w (DE-600)1287489-9 |w (DE-576)049958909 |x 0929-6212 |7 nnns |
| 773 | 1 | 8 | |g volume:91 |g year:2016 |g number:2 |g day:14 |g month:07 |g pages:691-707 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11277-016-3488-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MKW | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4266 | ||
| 951 | |a AR | ||
| 952 | |d 91 |j 2016 |e 2 |b 14 |c 07 |h 691-707 | ||
| author_variant |
k y ky y c yc d w dw h z hz |
|---|---|
| matchkey_str |
article:09296212:2016----::utuemmueslcinaeolhudrfitneih |
| hierarchy_sort_str |
2016 |
| publishDate |
2016 |
| allfields |
10.1007/s11277-016-3488-1 doi (DE-627)OLC2053800348 (DE-He213)s11277-016-3488-1-p DE-627 ger DE-627 rakwb eng 620 VZ Yuan, Kun verfasserin aut Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling Cao, Yewen aut Wang, Deqiang aut Zhang, Huanjing aut Enthalten in Wireless personal communications Springer US, 1994 91(2016), 2 vom: 14. Juli, Seite 691-707 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:91 year:2016 number:2 day:14 month:07 pages:691-707 https://doi.org/10.1007/s11277-016-3488-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 91 2016 2 14 07 691-707 |
| spelling |
10.1007/s11277-016-3488-1 doi (DE-627)OLC2053800348 (DE-He213)s11277-016-3488-1-p DE-627 ger DE-627 rakwb eng 620 VZ Yuan, Kun verfasserin aut Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling Cao, Yewen aut Wang, Deqiang aut Zhang, Huanjing aut Enthalten in Wireless personal communications Springer US, 1994 91(2016), 2 vom: 14. Juli, Seite 691-707 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:91 year:2016 number:2 day:14 month:07 pages:691-707 https://doi.org/10.1007/s11277-016-3488-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 91 2016 2 14 07 691-707 |
| allfields_unstemmed |
10.1007/s11277-016-3488-1 doi (DE-627)OLC2053800348 (DE-He213)s11277-016-3488-1-p DE-627 ger DE-627 rakwb eng 620 VZ Yuan, Kun verfasserin aut Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling Cao, Yewen aut Wang, Deqiang aut Zhang, Huanjing aut Enthalten in Wireless personal communications Springer US, 1994 91(2016), 2 vom: 14. Juli, Seite 691-707 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:91 year:2016 number:2 day:14 month:07 pages:691-707 https://doi.org/10.1007/s11277-016-3488-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 91 2016 2 14 07 691-707 |
| allfieldsGer |
10.1007/s11277-016-3488-1 doi (DE-627)OLC2053800348 (DE-He213)s11277-016-3488-1-p DE-627 ger DE-627 rakwb eng 620 VZ Yuan, Kun verfasserin aut Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling Cao, Yewen aut Wang, Deqiang aut Zhang, Huanjing aut Enthalten in Wireless personal communications Springer US, 1994 91(2016), 2 vom: 14. Juli, Seite 691-707 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:91 year:2016 number:2 day:14 month:07 pages:691-707 https://doi.org/10.1007/s11277-016-3488-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 91 2016 2 14 07 691-707 |
| allfieldsSound |
10.1007/s11277-016-3488-1 doi (DE-627)OLC2053800348 (DE-He213)s11277-016-3488-1-p DE-627 ger DE-627 rakwb eng 620 VZ Yuan, Kun verfasserin aut Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2016 Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling Cao, Yewen aut Wang, Deqiang aut Zhang, Huanjing aut Enthalten in Wireless personal communications Springer US, 1994 91(2016), 2 vom: 14. Juli, Seite 691-707 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:91 year:2016 number:2 day:14 month:07 pages:691-707 https://doi.org/10.1007/s11277-016-3488-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 91 2016 2 14 07 691-707 |
| language |
English |
| source |
Enthalten in Wireless personal communications 91(2016), 2 vom: 14. Juli, Seite 691-707 volume:91 year:2016 number:2 day:14 month:07 pages:691-707 |
| sourceStr |
Enthalten in Wireless personal communications 91(2016), 2 vom: 14. Juli, Seite 691-707 volume:91 year:2016 number:2 day:14 month:07 pages:691-707 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Wireless personal communications |
| authorswithroles_txt_mv |
Yuan, Kun @@aut@@ Cao, Yewen @@aut@@ Wang, Deqiang @@aut@@ Zhang, Huanjing @@aut@@ |
| publishDateDaySort_date |
2016-07-14T00:00:00Z |
| hierarchy_top_id |
188950273 |
| dewey-sort |
3620 |
| id |
OLC2053800348 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2053800348</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504075230.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11277-016-3488-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2053800348</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11277-016-3488-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yuan, Kun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2016</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Block diagonalization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Downlink system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-Hausdorff distance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MU-MIMO</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">User selection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Waterfilling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cao, Yewen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Deqiang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Huanjing</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Wireless personal communications</subfield><subfield code="d">Springer US, 1994</subfield><subfield code="g">91(2016), 2 vom: 14. Juli, Seite 691-707</subfield><subfield code="w">(DE-627)188950273</subfield><subfield code="w">(DE-600)1287489-9</subfield><subfield code="w">(DE-576)049958909</subfield><subfield code="x">0929-6212</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:91</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">day:14</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:691-707</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11277-016-3488-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">91</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="b">14</subfield><subfield code="c">07</subfield><subfield code="h">691-707</subfield></datafield></record></collection>
|
| author |
Yuan, Kun |
| spellingShingle |
Yuan, Kun ddc 620 misc Block diagonalization misc Downlink system misc -Hausdorff distance misc MU-MIMO misc User selection misc Waterfilling Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization |
| authorStr |
Yuan, Kun |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)188950273 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0929-6212 |
| topic_title |
620 VZ Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization Block diagonalization Downlink system -Hausdorff distance MU-MIMO User selection Waterfilling |
| topic |
ddc 620 misc Block diagonalization misc Downlink system misc -Hausdorff distance misc MU-MIMO misc User selection misc Waterfilling |
| topic_unstemmed |
ddc 620 misc Block diagonalization misc Downlink system misc -Hausdorff distance misc MU-MIMO misc User selection misc Waterfilling |
| topic_browse |
ddc 620 misc Block diagonalization misc Downlink system misc -Hausdorff distance misc MU-MIMO misc User selection misc Waterfilling |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Wireless personal communications |
| hierarchy_parent_id |
188950273 |
| dewey-tens |
620 - Engineering |
| hierarchy_top_title |
Wireless personal communications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 |
| title |
Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization |
| ctrlnum |
(DE-627)OLC2053800348 (DE-He213)s11277-016-3488-1-p |
| title_full |
Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization |
| author_sort |
Yuan, Kun |
| journal |
Wireless personal communications |
| journalStr |
Wireless personal communications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
691 |
| author_browse |
Yuan, Kun Cao, Yewen Wang, Deqiang Zhang, Huanjing |
| container_volume |
91 |
| class |
620 VZ |
| format_se |
Aufsätze |
| author-letter |
Yuan, Kun |
| doi_str_mv |
10.1007/s11277-016-3488-1 |
| dewey-full |
620 |
| title_sort |
multiuser mimo user selection based on l2-hausdorff distance with block diagonalization |
| title_auth |
Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization |
| abstract |
Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. © Springer Science+Business Media New York 2016 |
| abstractGer |
Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. © Springer Science+Business Media New York 2016 |
| abstract_unstemmed |
Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput. © Springer Science+Business Media New York 2016 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 |
| container_issue |
2 |
| title_short |
Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization |
| url |
https://doi.org/10.1007/s11277-016-3488-1 |
| remote_bool |
false |
| author2 |
Cao, Yewen Wang, Deqiang Zhang, Huanjing |
| author2Str |
Cao, Yewen Wang, Deqiang Zhang, Huanjing |
| ppnlink |
188950273 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11277-016-3488-1 |
| up_date |
2024-07-03T20:41:10.308Z |
| _version_ |
1803591897938132993 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2053800348</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504075230.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11277-016-3488-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2053800348</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11277-016-3488-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yuan, Kun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multiuser MIMO User Selection Based on L2-Hausdorff Distance with Block Diagonalization</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2016</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Block diagonalization (BD) is an important precoding method for multiuser multiple-input and multiple-output (MU-MIMO) broadcast channel (BC) systems. When the number of users is large, user selection (scheduling) should be performed so as to make full use of BD precoding. In this paper, based on $$L_{2}$$-Hausdorff distance, we propose two novel user selection algorithms, namely GUS-$$\hbox {D}_{{L_{2}}}$$ and US-$$\hbox {S}_{{L_{2}}}$$, for MU-MIMO BC systems with BD precoding to maximize the throughput. Both of the proposed algorithms select users iteratively and perform power allocation using the waterfilling method. In GUS-$$\hbox {D}_{{L_{2}}}$$, $$L_{2}$$-Hausdorff distance is used as a crucial factor for the user selection criterion. In US-$$\hbox {S}_{{L_{2}}}$$, besides the criterion in GUS-$$\hbox {D}_{{L_{2}}}$$, a similarity criterion based on $$L_{2}$$-hausdorff distance is employed to reduce the cardinality of the candidate user set effectively. The complexities of the proposed algorithms are analyzed and compared with those of typical existing algorithms. Simulations have been carried out to verify the performance of the proposed algorithms. Numerical results suggest that the proposed algorithms outperform most of their rivals in terms of complexity and show competitive performance in throughput.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Block diagonalization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Downlink system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-Hausdorff distance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MU-MIMO</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">User selection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Waterfilling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cao, Yewen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Deqiang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Huanjing</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Wireless personal communications</subfield><subfield code="d">Springer US, 1994</subfield><subfield code="g">91(2016), 2 vom: 14. Juli, Seite 691-707</subfield><subfield code="w">(DE-627)188950273</subfield><subfield code="w">(DE-600)1287489-9</subfield><subfield code="w">(DE-576)049958909</subfield><subfield code="x">0929-6212</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:91</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:2</subfield><subfield code="g">day:14</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:691-707</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11277-016-3488-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">91</subfield><subfield code="j">2016</subfield><subfield code="e">2</subfield><subfield code="b">14</subfield><subfield code="c">07</subfield><subfield code="h">691-707</subfield></datafield></record></collection>
|
| score |
7.400051 |