Unitary beamforming under constant modulus constraint in MIMO broadcast channels
SPAWC 2009, 10th IEEE International Workshop on Signal Processing Advances in Wireless Communications, June 21-24, 2009, Perugia, Italy
In this paper we analyse unitary beamforming in MIMO broadcast channels where the entries of the beamforming matrix are of constant modulus (CUBF). We provide a general formal description for the beamforming matrices. We show that this description encompasses currently applied constructions such as those based on the Householder transformation. Among other properties the CUBF proves to be particularly robust to channel feedback errors. We propose an iterative construction of the CUBF which maximizes the sum-rate of the system. Furthermore we provide numerical results that show significant gains of the CUBF compared to existing techniques.
| Mots Clés: | MIMO communication;array signal processing;broadcast channels;iterative methods |
| Type: | Conférence |
| Langue: | English |
| Ville: | Perugia |
| Pays: | ITALIE |
| Date: | Juin 2009 |
| Département: | Communications Mobiles |
| Eurecom ref: | 2742 |
| Copyright: | © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Bibtex: | @inproceedings{EURECOM+2742, doi = { http://dx.doi.org/10.1109/SPAWC.2009.5161766}, year = {2009}, title = {{U}nitary beamforming under constant modulus constraint in {MIMO} broadcast channels}, author = {{W}agner, {S}ebastian and {S}esia, {S}tefania and {S}lock, {D}irk {T} {M}}, booktitle = {{SPAWC} 2009, 10th {IEEE} {I}nternational {W}orkshop on {S}ignal {P}rocessing {A}dvances in {W}ireless {C}ommunications, {J}une 21-24, 2009, {P}erugia, {I}taly}, address = {{P}erugia, {ITALIE}}, month = {06}, url = {http://www.eurecom.fr/publication/2742} } |
| Voir aussi: |
|
Permalink: http://www.eurecom.fr/publication/2742
