On the User Selection for MIMO Broadcast Channels
| dc.creator | Bayesteh, Alireza | |
| dc.creator | Khandani, Amir Keyvan | |
| dc.date | 2006-10-30 | |
| dc.date.accessioned | 2026-07-07T08:16:47Z | |
| dc.date.available | 2026-07-07T08:16:47Z | |
| dc.description | In this paper, a downlink communication system, in which a Base Station (BS) equipped with $M$ antennas communicates with $N$ users each equipped with $K$ receive antennas, is considered. An efficient suboptimum algorithm is proposed for selecting a set of users in order to maximize the sum-rate throughput of the system. For the asymptotic case when $N$ tends to infinity, the necessary and sufficient conditions in order to achieve the maximum sum-rate throughput, such that the difference between the achievable sum-rate and the maximum value approaches zero, is derived. The complexity of our algorithm is investigated in terms of the required amount of feedback from the users to the base station, as well as the number of searches required for selecting the users. It is shown that the proposed method is capable of achieving a large portion of the sum-rate capacity, with a very low complexity. | |
| dc.description | 57 pages 5 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0610169 | |
| dc.identifier | http://arxiv.org/abs/cs/0610169 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133905 | |
| dc.subject | Information Theory | |
| dc.title | On the User Selection for MIMO Broadcast Channels | |
| dc.type | text |