Sciweavers

Share
ICC
2007
IEEE

A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation

9 years 5 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
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 suboptimal SDMA grouping algorithms to solve this problem. Such algorithms, however, usually depend on the precoding 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 precoding 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 consi...
Tarcisio F. Maciel, Anja Klein
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ICC
Authors Tarcisio F. Maciel, Anja Klein
Comments (0)
books