Ranran Zhang, Aimin Yang, G. Xie, Yuan'an Liu, B. Tang
{"title":"Optimal robust bit and power allocation for MIMO systems","authors":"Ranran Zhang, Aimin Yang, G. Xie, Yuan'an Liu, B. Tang","doi":"10.1109/ISCIT.2007.4392051","DOIUrl":null,"url":null,"abstract":"This paper investigates the optimal bit and power allocation to minimize transmission power under system bit error rate (BER) and transmission rate requirements for multiple-input multiple-output (MIMO) systems with imperfect channel state information (CSI). A robust greedy algorithm is proposed and proved to be the optimal robust bit and power allocation by simulation. Simulation results also show that the proposed robust algorithm has steady BER performance, and can satisfy the system BER requirement when the CSI error increases, while the non-robust greedy algorithm can not.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Communications and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2007.4392051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper investigates the optimal bit and power allocation to minimize transmission power under system bit error rate (BER) and transmission rate requirements for multiple-input multiple-output (MIMO) systems with imperfect channel state information (CSI). A robust greedy algorithm is proposed and proved to be the optimal robust bit and power allocation by simulation. Simulation results also show that the proposed robust algorithm has steady BER performance, and can satisfy the system BER requirement when the CSI error increases, while the non-robust greedy algorithm can not.