A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System

Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from c...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Huang, Yongming [verfasserIn] Yang, Luxi [verfasserIn] Liu, Ju [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2008

Schlagwörter:	Algorithm Schedule Throughput Performance SDMA Array Processing Good Throughput

Übergeordnetes Werk:	Enthalten in: EURASIP journal on advances in signal processing - Heidelberg : Springer, 2007, 2008(2008), 1 vom: 04. Sept.
Übergeordnetes Werk:	volume:2008 ; year:2008 ; number:1 ; day:04 ; month:09

Links:	Volltext

DOI / URN:	10.1155/2008/947869

Katalog-ID:	SPR031989888

Internformat


LEADER	01000caa a22002652 4500
001	SPR031989888
003	DE-627
005	20220111195013.0
007	cr uuu---uuuuu
008	201007s2008 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1155/2008/947869 \|2 doi
035			\|a (DE-627)SPR031989888
035			\|a (SPR)947869-e
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 620 \|q ASE
084			\|a 53.73 \|2 bkl
100	1		\|a Huang, Yongming \|e verfasserin \|4 aut
245	1	2	\|a A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System
264		1	\|c 2008
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead.
650		4	\|a Algorithm Schedule \|7 (dpeaa)DE-He213
650		4	\|a Throughput Performance \|7 (dpeaa)DE-He213
650		4	\|a SDMA \|7 (dpeaa)DE-He213
650		4	\|a Array Processing \|7 (dpeaa)DE-He213
650		4	\|a Good Throughput \|7 (dpeaa)DE-He213
700	1		\|a Yang, Luxi \|e verfasserin \|4 aut
700	1		\|a Liu, Ju \|e verfasserin \|4 aut
773	0	8	\|i Enthalten in \|t EURASIP journal on advances in signal processing \|d Heidelberg : Springer, 2007 \|g 2008(2008), 1 vom: 04. Sept. \|w (DE-627)534054277 \|w (DE-600)2364203-8 \|x 1687-6180 \|7 nnns
773	1	8	\|g volume:2008 \|g year:2008 \|g number:1 \|g day:04 \|g month:09
856	4	0	\|u https://dx.doi.org/10.1155/2008/947869 \|z kostenfrei \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_SPRINGER
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
936	b	k	\|a 53.73 \|q ASE
951			\|a AR
952			\|d 2008 \|j 2008 \|e 1 \|b 04 \|c 09

Indexfelder

author_variant	y h yh l y ly j l jl
matchkey_str	article:16876180:2008----::lmtdedakdaodwlnomlisrioo
hierarchy_sort_str	2008
bklnumber	53.73
publishDate	2008
allfields	10.1155/2008/947869 doi (DE-627)SPR031989888 (SPR)947869-e DE-627 ger DE-627 rakwb eng 620 ASE 53.73 bkl Huang, Yongming verfasserin aut A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System 2008 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead. Algorithm Schedule (dpeaa)DE-He213 Throughput Performance (dpeaa)DE-He213 SDMA (dpeaa)DE-He213 Array Processing (dpeaa)DE-He213 Good Throughput (dpeaa)DE-He213 Yang, Luxi verfasserin aut Liu, Ju verfasserin aut Enthalten in EURASIP journal on advances in signal processing Heidelberg : Springer, 2007 2008(2008), 1 vom: 04. Sept. (DE-627)534054277 (DE-600)2364203-8 1687-6180 nnns volume:2008 year:2008 number:1 day:04 month:09 https://dx.doi.org/10.1155/2008/947869 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 53.73 ASE AR 2008 2008 1 04 09
spelling	10.1155/2008/947869 doi (DE-627)SPR031989888 (SPR)947869-e DE-627 ger DE-627 rakwb eng 620 ASE 53.73 bkl Huang, Yongming verfasserin aut A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System 2008 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead. Algorithm Schedule (dpeaa)DE-He213 Throughput Performance (dpeaa)DE-He213 SDMA (dpeaa)DE-He213 Array Processing (dpeaa)DE-He213 Good Throughput (dpeaa)DE-He213 Yang, Luxi verfasserin aut Liu, Ju verfasserin aut Enthalten in EURASIP journal on advances in signal processing Heidelberg : Springer, 2007 2008(2008), 1 vom: 04. Sept. (DE-627)534054277 (DE-600)2364203-8 1687-6180 nnns volume:2008 year:2008 number:1 day:04 month:09 https://dx.doi.org/10.1155/2008/947869 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 53.73 ASE AR 2008 2008 1 04 09
allfields_unstemmed	10.1155/2008/947869 doi (DE-627)SPR031989888 (SPR)947869-e DE-627 ger DE-627 rakwb eng 620 ASE 53.73 bkl Huang, Yongming verfasserin aut A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System 2008 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead. Algorithm Schedule (dpeaa)DE-He213 Throughput Performance (dpeaa)DE-He213 SDMA (dpeaa)DE-He213 Array Processing (dpeaa)DE-He213 Good Throughput (dpeaa)DE-He213 Yang, Luxi verfasserin aut Liu, Ju verfasserin aut Enthalten in EURASIP journal on advances in signal processing Heidelberg : Springer, 2007 2008(2008), 1 vom: 04. Sept. (DE-627)534054277 (DE-600)2364203-8 1687-6180 nnns volume:2008 year:2008 number:1 day:04 month:09 https://dx.doi.org/10.1155/2008/947869 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 53.73 ASE AR 2008 2008 1 04 09
allfieldsGer	10.1155/2008/947869 doi (DE-627)SPR031989888 (SPR)947869-e DE-627 ger DE-627 rakwb eng 620 ASE 53.73 bkl Huang, Yongming verfasserin aut A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System 2008 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead. Algorithm Schedule (dpeaa)DE-He213 Throughput Performance (dpeaa)DE-He213 SDMA (dpeaa)DE-He213 Array Processing (dpeaa)DE-He213 Good Throughput (dpeaa)DE-He213 Yang, Luxi verfasserin aut Liu, Ju verfasserin aut Enthalten in EURASIP journal on advances in signal processing Heidelberg : Springer, 2007 2008(2008), 1 vom: 04. Sept. (DE-627)534054277 (DE-600)2364203-8 1687-6180 nnns volume:2008 year:2008 number:1 day:04 month:09 https://dx.doi.org/10.1155/2008/947869 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 53.73 ASE AR 2008 2008 1 04 09
allfieldsSound	10.1155/2008/947869 doi (DE-627)SPR031989888 (SPR)947869-e DE-627 ger DE-627 rakwb eng 620 ASE 53.73 bkl Huang, Yongming verfasserin aut A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System 2008 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead. Algorithm Schedule (dpeaa)DE-He213 Throughput Performance (dpeaa)DE-He213 SDMA (dpeaa)DE-He213 Array Processing (dpeaa)DE-He213 Good Throughput (dpeaa)DE-He213 Yang, Luxi verfasserin aut Liu, Ju verfasserin aut Enthalten in EURASIP journal on advances in signal processing Heidelberg : Springer, 2007 2008(2008), 1 vom: 04. Sept. (DE-627)534054277 (DE-600)2364203-8 1687-6180 nnns volume:2008 year:2008 number:1 day:04 month:09 https://dx.doi.org/10.1155/2008/947869 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 53.73 ASE AR 2008 2008 1 04 09
language	English
source	Enthalten in EURASIP journal on advances in signal processing 2008(2008), 1 vom: 04. Sept. volume:2008 year:2008 number:1 day:04 month:09
sourceStr	Enthalten in EURASIP journal on advances in signal processing 2008(2008), 1 vom: 04. Sept. volume:2008 year:2008 number:1 day:04 month:09
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Algorithm Schedule Throughput Performance SDMA Array Processing Good Throughput
dewey-raw	620
isfreeaccess_bool	true
container_title	EURASIP journal on advances in signal processing
authorswithroles_txt_mv	Huang, Yongming @@aut@@ Yang, Luxi @@aut@@ Liu, Ju @@aut@@
publishDateDaySort_date	2008-09-04T00:00:00Z
hierarchy_top_id	534054277
dewey-sort	3620
id	SPR031989888
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">SPR031989888</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111195013.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2008 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1155/2008/947869</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR031989888</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)947869-e</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">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Huang, Yongming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2008</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Schedule</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput Performance</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SDMA</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Array Processing</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Good Throughput</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Luxi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Ju</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">EURASIP journal on advances in signal processing</subfield><subfield code="d">Heidelberg : Springer, 2007</subfield><subfield code="g">2008(2008), 1 vom: 04. Sept.</subfield><subfield code="w">(DE-627)534054277</subfield><subfield code="w">(DE-600)2364203-8</subfield><subfield code="x">1687-6180</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:2008</subfield><subfield code="g">year:2008</subfield><subfield code="g">number:1</subfield><subfield code="g">day:04</subfield><subfield code="g">month:09</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1155/2008/947869</subfield><subfield code="z">kostenfrei</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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">53.73</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">2008</subfield><subfield code="j">2008</subfield><subfield code="e">1</subfield><subfield code="b">04</subfield><subfield code="c">09</subfield></datafield></record></collection>
author	Huang, Yongming
spellingShingle	Huang, Yongming ddc 620 bkl 53.73 misc Algorithm Schedule misc Throughput Performance misc SDMA misc Array Processing misc Good Throughput A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System
authorStr	Huang, Yongming
ppnlink_with_tag_str_mv	@@773@@(DE-627)534054277
format	electronic Article
dewey-ones	620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut aut aut
collection	springer
remote_str	true
illustrated	Not Illustrated
issn	1687-6180
topic_title	620 ASE 53.73 bkl A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System Algorithm Schedule (dpeaa)DE-He213 Throughput Performance (dpeaa)DE-He213 SDMA (dpeaa)DE-He213 Array Processing (dpeaa)DE-He213 Good Throughput (dpeaa)DE-He213
topic	ddc 620 bkl 53.73 misc Algorithm Schedule misc Throughput Performance misc SDMA misc Array Processing misc Good Throughput
topic_unstemmed	ddc 620 bkl 53.73 misc Algorithm Schedule misc Throughput Performance misc SDMA misc Array Processing misc Good Throughput
topic_browse	ddc 620 bkl 53.73 misc Algorithm Schedule misc Throughput Performance misc SDMA misc Array Processing misc Good Throughput
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	EURASIP journal on advances in signal processing
hierarchy_parent_id	534054277
dewey-tens	620 - Engineering
hierarchy_top_title	EURASIP journal on advances in signal processing
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)534054277 (DE-600)2364203-8
title	A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System
ctrlnum	(DE-627)SPR031989888 (SPR)947869-e
title_full	A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System
author_sort	Huang, Yongming
journal	EURASIP journal on advances in signal processing
journalStr	EURASIP journal on advances in signal processing
lang_code	eng
isOA_bool	true
dewey-hundreds	600 - Technology
recordtype	marc
publishDateSort	2008
contenttype_str_mv	txt
author_browse	Huang, Yongming Yang, Luxi Liu, Ju
container_volume	2008
class	620 ASE 53.73 bkl
format_se	Elektronische Aufsätze
author-letter	Huang, Yongming
doi_str_mv	10.1155/2008/947869
dewey-full	620
author2-role	verfasserin
title_sort	limited feedback sdma for downlink of multiuser mimo communication system
title_auth	A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System
abstract	Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead.
abstractGer	Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead.
abstract_unstemmed	Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	1
title_short	A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System
url	https://dx.doi.org/10.1155/2008/947869
remote_bool	true
author2	Yang, Luxi Liu, Ju
author2Str	Yang, Luxi Liu, Ju
ppnlink	534054277
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1155/2008/947869
up_date	2024-07-04T02:04:31.510Z
_version_	1803612241540415488
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">SPR031989888</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111195013.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2008 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1155/2008/947869</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR031989888</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)947869-e</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">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Huang, Yongming</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2008</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper proposes a limited feedback SDMA scheme of combining opportunistic scheduling and codebook-based multiuser precoding. A new systematic construction for SDMA codebook, which comprises a set of precoders for multiple simultaneously active users, is first presented. Different from conventional Grassmannian codebook, the proposed codebook is designed in terms of array processing and has a cluster-based structure, with each cluster generated using a perturbation method. In order to tackle the intractable interuser interference issue inhered in limited feedback SDMA, this paper further proposes two novel opportunistic scheduling algorithms, which are able to fully exploit the cluster structure of the proposed codebook. The first proposed algorithm schedules the simultaneous users and their preferred precoders in a successive way, and is implemented in a Markov-like fashion. The second proposed algorithm is capable of rapidly finding a group of channel-matching users along with their preferred precoders. Simulation results demonstrate that in sparse networks, the proposed SDMA exhibits a better throughput performance than the conventional limited feedback SDMA does, while both having a comparable feedback overhead.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Schedule</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput Performance</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SDMA</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Array Processing</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Good Throughput</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Luxi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Ju</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">EURASIP journal on advances in signal processing</subfield><subfield code="d">Heidelberg : Springer, 2007</subfield><subfield code="g">2008(2008), 1 vom: 04. Sept.</subfield><subfield code="w">(DE-627)534054277</subfield><subfield code="w">(DE-600)2364203-8</subfield><subfield code="x">1687-6180</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:2008</subfield><subfield code="g">year:2008</subfield><subfield code="g">number:1</subfield><subfield code="g">day:04</subfield><subfield code="g">month:09</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1155/2008/947869</subfield><subfield code="z">kostenfrei</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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">53.73</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">2008</subfield><subfield code="j">2008</subfield><subfield code="e">1</subfield><subfield code="b">04</subfield><subfield code="c">09</subfield></datafield></record></collection>
score	7.3980665

Nicht das Richtige dabei?

Schreiben Sie uns!

A Limited Feedback SDMA for Downlink of Multiuser MIMO Communication System

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?