{"title":"Convex optimization based minimum probability of error beamforming in the uplink of a multiuser system","authors":"Majid Bavand, P. Azmi, S. Blostein","doi":"10.1109/QBSC.2014.6841178","DOIUrl":null,"url":null,"abstract":"Motivated by power-limited uplink access, this paper proposes a receiver optimization for the uplink of a spatial multiple access scenario based on the concept of minimum probability of error (MPE) beamforming. Although MPE beamforming is shown to be more effective than the classical beamforming methods, it results in a non-convex and a highly nonlinear optimization problem. To resolve this problem, a set of modulated-based constraints is added to the MPE beamforming technique. It is shown that the solution to the constrained problem is equivalent to the original one. Moreover, it is proved that the constrained problem does not suffer from the existence of local minima and also has a unique global minimum. Finally the constrained problem is transformed into a convex optimization problem which can be solved using the existing convex programming algorithms.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 27th Biennial Symposium on Communications (QBSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QBSC.2014.6841178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Motivated by power-limited uplink access, this paper proposes a receiver optimization for the uplink of a spatial multiple access scenario based on the concept of minimum probability of error (MPE) beamforming. Although MPE beamforming is shown to be more effective than the classical beamforming methods, it results in a non-convex and a highly nonlinear optimization problem. To resolve this problem, a set of modulated-based constraints is added to the MPE beamforming technique. It is shown that the solution to the constrained problem is equivalent to the original one. Moreover, it is proved that the constrained problem does not suffer from the existence of local minima and also has a unique global minimum. Finally the constrained problem is transformed into a convex optimization problem which can be solved using the existing convex programming algorithms.