Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. 2005
DOI: 10.1109/isit.2005.1523763
|View full text |Cite
|
Sign up to set email alerts
|

On the user selection for MIMO broadcast channels

Abstract: 1 In this paper, we consider a downlink communication system, in which a base station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas. We propose an efficient suboptimum algorithm for selecting a set of users in order to maximize the sum-rate throughput of the system. For the asymptotic case of N → ∞, it is shown that by using a very simple precoding scheme of zeroforcing beam-forming, the optimum sum-rate which behaves like M log log N can be achieved. The complex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

4
102
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 79 publications
(109 citation statements)
references
References 25 publications
(41 reference statements)
4
102
0
Order By: Relevance
“…Through the use of a simple norm-threshold feedback protocol, the maximal scaling of the sum rate is achievable [25]. In [26], only those users with the singular values above a set threshold are allowed to feed back the channel information to the BS. In [27], a low-complexity suboptimal user selection scheme, which was referred to as the semi-orthogonal user selection (SUS) algorithm, was proposed.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Through the use of a simple norm-threshold feedback protocol, the maximal scaling of the sum rate is achievable [25]. In [26], only those users with the singular values above a set threshold are allowed to feed back the channel information to the BS. In [27], a low-complexity suboptimal user selection scheme, which was referred to as the semi-orthogonal user selection (SUS) algorithm, was proposed.…”
Section: Introductionmentioning
confidence: 99%
“…In [27], a low-complexity suboptimal user selection scheme, which was referred to as the semi-orthogonal user selection (SUS) algorithm, was proposed. When the user selection algorithms in [26] and [27] are combined with zero-forcing (ZF) beamforming, the optimum sum-rate throughput can be asymptotically achieved when K goes to infinity.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This limitation, however, is acceptable in real systems, where spatial division multiplexing access (SDMA) is used in conjunction with single user MIMO transmissions using adaptive switching [21]. Therefore, SDMA targets high cell throughput, which is optimal with infinite number of users in the network [22], while spatial multiplexing to a single user targets high peak rates.…”
Section: System Modelmentioning
confidence: 99%
“…In general, user selection problems are combinatorial problems, and the complexity required to solve the problems could be prohibitively high for a large multiuser MIMO system. Thus, low-complexity suboptimal selection strategies are considered in [14][15][16][17][18][19][20][21], at the expense of degraded performance. In [14][15][16][17], a single antenna is selected at a time to maximize the throughput based on greedy selection schemes.…”
Section: Introductionmentioning
confidence: 99%