Maciel, Tarcisio Ferreira ; Klein, Anja (2007)
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation.
IEEE International Conference on Communications (ICC 2007). Glasgow, Scotland (24.-28.06.2007)
doi: 10.1109/ICC.2007.884
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs that maximizes system capacity using SDMA is a complex combinatorial problem, which can only be assuredly solved through an Exhaustive Search (ES). Because an ES is usually too complex, there are several sub- optimal SDMA grouping algorithms to solve this problem. Such algorithms, however, usually depend on the preceding matrices of candidate SDMA groups and are also considerably complex. In this work, an SDMA grouping algorithm is proposed for the downlink of multi-user multiple input multiple output systems. It is based on the spatial correlation and gains of the MSs' channels in the SDMA group, thus not depending on preceding and having low complexity. The proposed algorithm is formulated as a convex quadratic optimization problem and is efficiently solved by convex optimization methods. It is analyzed considering zero-forcing precoding and it is shown to almost achieve the performance of an ES for the SDMA group that maximizes the system capacity.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2007 |
| Autor(en): | Maciel, Tarcisio Ferreira ; Klein, Anja |
| Art des Eintrags: | Bibliographie |
| Titel: | A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation |
| Sprache: | Englisch |
| Publikationsjahr: | 13 August 2007 |
| Verlag: | IEEE |
| Buchtitel: | 2007 IEEE International Conference on Communications |
| Veranstaltungstitel: | IEEE International Conference on Communications (ICC 2007) |
| Veranstaltungsort: | Glasgow, Scotland |
| Veranstaltungsdatum: | 24.-28.06.2007 |
| DOI: | 10.1109/ICC.2007.884 |
| Kurzbeschreibung (Abstract): | Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs that maximizes system capacity using SDMA is a complex combinatorial problem, which can only be assuredly solved through an Exhaustive Search (ES). Because an ES is usually too complex, there are several sub- optimal SDMA grouping algorithms to solve this problem. Such algorithms, however, usually depend on the preceding matrices of candidate SDMA groups and are also considerably complex. In this work, an SDMA grouping algorithm is proposed for the downlink of multi-user multiple input multiple output systems. It is based on the spatial correlation and gains of the MSs' channels in the SDMA group, thus not depending on preceding and having low complexity. The proposed algorithm is formulated as a convex quadratic optimization problem and is efficiently solved by convex optimization methods. It is analyzed considering zero-forcing precoding and it is shown to almost achieve the performance of an ES for the SDMA group that maximizes the system capacity. |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Kommunikationstechnik |
| Hinterlegungsdatum: | 12 Jul 2023 07:23 |
| Letzte Änderung: | 12 Jul 2023 07:23 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum