{"title":"2 × 2干扰信道功率控制的顺序几何规划","authors":"M. Charafeddine, A. Paulraj","doi":"10.1109/CISS.2007.4298297","DOIUrl":null,"url":null,"abstract":"We analyze the performance of sequential geometric programming (SGP) in solving the nonconvex power control problem of maximizing the sum capacity of the interference channel with no multiuser decoding. We focus on the 2x2 interference channel, for which we know the optimal power allocation tuples. We validate the SGP approaches of single and double condensation methods and we analyze the accuracy and convergence performance of each.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Sequential Geometric Programming for 2 × 2 Interference Channel Power Control\",\"authors\":\"M. Charafeddine, A. Paulraj\",\"doi\":\"10.1109/CISS.2007.4298297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze the performance of sequential geometric programming (SGP) in solving the nonconvex power control problem of maximizing the sum capacity of the interference channel with no multiuser decoding. We focus on the 2x2 interference channel, for which we know the optimal power allocation tuples. We validate the SGP approaches of single and double condensation methods and we analyze the accuracy and convergence performance of each.\",\"PeriodicalId\":151241,\"journal\":{\"name\":\"2007 41st Annual Conference on Information Sciences and Systems\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 41st Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2007.4298297\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 41st Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2007.4298297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sequential Geometric Programming for 2 × 2 Interference Channel Power Control
We analyze the performance of sequential geometric programming (SGP) in solving the nonconvex power control problem of maximizing the sum capacity of the interference channel with no multiuser decoding. We focus on the 2x2 interference channel, for which we know the optimal power allocation tuples. We validate the SGP approaches of single and double condensation methods and we analyze the accuracy and convergence performance of each.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
