Back to Search
Start Over
Effective beamforming and efficient scheduling for multi-user MIMO broadcast channels
- Source :
- Information Theory Workshop ITW 2009, Taormina, 2009, info:cnr-pdr/source/autori:A. Tomasoni, M. Ferrari, S. Bellini, G. Caire/congresso_nome:Information Theory Workshop ITW 2009/congresso_luogo:Taormina/congresso_data:2009/anno:2009/pagina_da:/pagina_a:/intervallo_pagine
- Publication Year :
- 2009
- Publisher :
- IEEE, 2009.
-
Abstract
- In this paper, we focus on Multi-User MIMO Broadcast Channels with few users feeding back their channel estimates, i.e. K linear in the number M of transmitting antennas. Under this condition, the chance of finding a subset of users almost orthogonal vanishes when M gets large. For this reason, we show that the Zero Forcing (ZF) beamformer, commonly accepted for practical implementations, can be easily outperformed by other schemes based on QR decomposition, approaching the channel capacity. Our beamformer construction is less complex than ZF greedy algorithms and more robust than semi-orthogonal construction. At high SNR, we show that even the sub-optimal Tomlinson-Harashima encoding technique outperforms the ZF beamforming, halving the gap with respect to Dirty Paper Coding.
- Subjects :
- Beamforming
Dirty Paper Coding
Computer science
business.industry
MIMO
Data_CODINGANDINFORMATIONTHEORY
Precoding
Multi-user MIMO
QR decomposition
Channel capacity
Broadcast Channels
Tomlinson-Harashima
Dirty paper coding
Multi-User MIMO
Greedy algorithm
business
Algorithm
Computer Science::Information Theory
Computer network
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2009 IEEE Information Theory Workshop
- Accession number :
- edsair.doi.dedup.....12d5f2b1c1ef76e43d3c4e53ab3627f6