{"title":"Adaptive Orthogonal Beamforming for the Mimo Broadcast Channel","authors":"J. Duplicy, D. Palomar, L. Vandendorpe","doi":"10.1109/CAMSAP.2007.4497969","DOIUrl":null,"url":null,"abstract":"This paper addresses both the user selection and the linear precoding design of a MIMO broadcast channel where the number of users is assumed to be greater than the number of transmit antennas. The optimization criterion considered is the sum-rate. A greedy algorithm tackling jointly the two issues is developed. It sequentially adds new users so as their beamformers build up an orthonormal basis which is optimized with the help of the channel knowledge assumed to be exhaustive. This solution benefits asymptotically (in the limit of a large number of users) from the full multiplexing and multiuser diversity gains alike the capacity achieving dirty paper coding. Moreover, it exhibits better results than existing schemes and offers some advantages resulting from the choice of an orthogonal structure.","PeriodicalId":220687,"journal":{"name":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMSAP.2007.4497969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
This paper addresses both the user selection and the linear precoding design of a MIMO broadcast channel where the number of users is assumed to be greater than the number of transmit antennas. The optimization criterion considered is the sum-rate. A greedy algorithm tackling jointly the two issues is developed. It sequentially adds new users so as their beamformers build up an orthonormal basis which is optimized with the help of the channel knowledge assumed to be exhaustive. This solution benefits asymptotically (in the limit of a large number of users) from the full multiplexing and multiuser diversity gains alike the capacity achieving dirty paper coding. Moreover, it exhibits better results than existing schemes and offers some advantages resulting from the choice of an orthogonal structure.