{"title":"一种基于权重的分布式OSTBC系统低复杂度功率分配方案","authors":"Xingzai Lv, Jinkang Zhu","doi":"10.1109/NSWCTC.2009.83","DOIUrl":null,"url":null,"abstract":"Distributed wireless communication system has been considered as a promising architecture for future wireless communication networks. This paper aims to characterize the power allocation scheme for orthogonal space time block coding in DWCS. Firstly, an optimal method is investigated, which minimizes the upper bound of the ergodic pair-wise symbol error rate, and it is proved to be equivalent to water¿lling based on the knowledge of large-scale fading. In order to reduce the complexity, a low-complexity power allocation method is proposed through approximating the optimization problem. This method assigns a power allocation weight to each distributed base station, and then allocates the power to base stations proportional to these weights. Numerical results show that the performance of this low-complexity algorithm holds close performance with the water¿lling method in most situations.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Novel Low-Complexity Weight Based Power Allocation Scheme for Distributed OSTBC System\",\"authors\":\"Xingzai Lv, Jinkang Zhu\",\"doi\":\"10.1109/NSWCTC.2009.83\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed wireless communication system has been considered as a promising architecture for future wireless communication networks. This paper aims to characterize the power allocation scheme for orthogonal space time block coding in DWCS. Firstly, an optimal method is investigated, which minimizes the upper bound of the ergodic pair-wise symbol error rate, and it is proved to be equivalent to water¿lling based on the knowledge of large-scale fading. In order to reduce the complexity, a low-complexity power allocation method is proposed through approximating the optimization problem. This method assigns a power allocation weight to each distributed base station, and then allocates the power to base stations proportional to these weights. Numerical results show that the performance of this low-complexity algorithm holds close performance with the water¿lling method in most situations.\",\"PeriodicalId\":433291,\"journal\":{\"name\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSWCTC.2009.83\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSWCTC.2009.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel Low-Complexity Weight Based Power Allocation Scheme for Distributed OSTBC System
Distributed wireless communication system has been considered as a promising architecture for future wireless communication networks. This paper aims to characterize the power allocation scheme for orthogonal space time block coding in DWCS. Firstly, an optimal method is investigated, which minimizes the upper bound of the ergodic pair-wise symbol error rate, and it is proved to be equivalent to water¿lling based on the knowledge of large-scale fading. In order to reduce the complexity, a low-complexity power allocation method is proposed through approximating the optimization problem. This method assigns a power allocation weight to each distributed base station, and then allocates the power to base stations proportional to these weights. Numerical results show that the performance of this low-complexity algorithm holds close performance with the water¿lling method in most situations.