Name
Title | ||
|---|---|---|
Greedy user selection for zero-forcing and MMSE multiuser beamforming with channel estimation errors |
Abstract | ||
|---|---|---|
In a multi-user MIMO downlink where the base station has only estimates of the channels of the users, the sum-rate of multi-user beamforming saturates at high SNR. However, this is not the case for single-user beamforming. We propose a low-complexity user scheduling algorithm that selects the number of active users based on a closed-form approximation of the average sum-rate, and in particular does not add multiple users in the single-user optimality range. In order to develop this algorithm we derive the expected value of the rate of zero-forcing beamforming and MMSE beamforming with estimated channels and modify the greedy user selection accordingly. The gain of the proposed method is shown in numerical simulations. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICASSP.2008.4518315 | Las Vegas, NV |
Keywords | Field | DocType |
MIMO communication,channel estimation,least mean squares methods,multiuser channels,MMSE multiuser beamforming,channel estimation errors,closed-form approximation,greedy user selection,low-complexity user scheduling algorithm,multiuser MIMO downlink,zero-forcing beamforming,Broadcast channel (BC),downlink scheduling,imperfect channel state information (CSI),multiple-input multiple-output (MIMO),zero-forcing beamforming (ZFBF) | WSDMA,Base station,Beamforming,Mathematical optimization,Computer science,Scheduling (computing),MIMO,Communication channel,Precoding,Telecommunications link | Conference |
ISSN | ISBN | Citations |
1520-6149 E-ISBN : 978-1-4244-1484-0 | 978-1-4244-1484-0 | 6 |
PageRank | References | Authors |
0.54 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olof Sjöbergh | 1 | 6 | 0.54 |
| Eduard A. Jorswieck | 2 | 707 | 45.58 |
| Erik G. Larsson | 3 | 10189 | 605.81 |