{"title":"功率放大器消耗功率和天线辐射功率约束下的MIMO容量","authors":"Hei Victor Cheng, Daniel Persson, E. Larsson","doi":"10.1109/SPAWC.2014.6941397","DOIUrl":null,"url":null,"abstract":"We investigate the capacity of the multiple-input-multiple-output channel taking into account the consumed power in the power amplifiers. The mutual information is optimized with a limitation of total consumed power and per-antenna radiated power for a fixed channel with full channel state information at both the transmitter and receiver. The capacity is thus obtained by optimizing the input distribution to maximize the mutual information. Since the optimization problem is non-convex, direct computation of the capacity suffers from high computational complexity. Hence upper and lower bounds on the capacity are given as benchmarks for different ad-hoc schemes. An efficient suboptimal algorithm is also presented. Numerical results show that the suboptimal algorithm performs close to the capacity.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"398 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"MIMO capacity under power amplifiers consumed power and per-antenna radiated power constraints\",\"authors\":\"Hei Victor Cheng, Daniel Persson, E. Larsson\",\"doi\":\"10.1109/SPAWC.2014.6941397\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the capacity of the multiple-input-multiple-output channel taking into account the consumed power in the power amplifiers. The mutual information is optimized with a limitation of total consumed power and per-antenna radiated power for a fixed channel with full channel state information at both the transmitter and receiver. The capacity is thus obtained by optimizing the input distribution to maximize the mutual information. Since the optimization problem is non-convex, direct computation of the capacity suffers from high computational complexity. Hence upper and lower bounds on the capacity are given as benchmarks for different ad-hoc schemes. An efficient suboptimal algorithm is also presented. Numerical results show that the suboptimal algorithm performs close to the capacity.\",\"PeriodicalId\":420837,\"journal\":{\"name\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"398 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2014.6941397\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2014.6941397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
MIMO capacity under power amplifiers consumed power and per-antenna radiated power constraints
We investigate the capacity of the multiple-input-multiple-output channel taking into account the consumed power in the power amplifiers. The mutual information is optimized with a limitation of total consumed power and per-antenna radiated power for a fixed channel with full channel state information at both the transmitter and receiver. The capacity is thus obtained by optimizing the input distribution to maximize the mutual information. Since the optimization problem is non-convex, direct computation of the capacity suffers from high computational complexity. Hence upper and lower bounds on the capacity are given as benchmarks for different ad-hoc schemes. An efficient suboptimal algorithm is also presented. Numerical results show that the suboptimal algorithm performs close to the capacity.