Tran Thi Thuy, Nguyen Van Nam, Ngo Tung Son, Tran Van Dinh
{"title":"DC Programming and DCA for Power Minimization Problem in Multi-User Beamforming Networks","authors":"Tran Thi Thuy, Nguyen Van Nam, Ngo Tung Son, Tran Van Dinh","doi":"10.1145/3316615.3316665","DOIUrl":null,"url":null,"abstract":"The beamforming technique is increasingly used in multi-user relay networks for directional signal transmission. The main purpose of this paper is to design beamforming coefficients to minimize the total relay transmitted power under destination Quality-of-Service (QoS) constraints. There are some techniques have been proposed previously to solve the class of these problems such as: semidefinite relaxation approach (SDR) and convex second-order cone programing form (SOCP). We propose another method named Difference of Convex functions Algorithm (DCA) and evaluate the performance of this approach.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"327 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3316615.3316665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The beamforming technique is increasingly used in multi-user relay networks for directional signal transmission. The main purpose of this paper is to design beamforming coefficients to minimize the total relay transmitted power under destination Quality-of-Service (QoS) constraints. There are some techniques have been proposed previously to solve the class of these problems such as: semidefinite relaxation approach (SDR) and convex second-order cone programing form (SOCP). We propose another method named Difference of Convex functions Algorithm (DCA) and evaluate the performance of this approach.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
