{"title":"用直流编程优化MIMO干扰信道的线性预编码器","authors":"H. H. M. Tam, E. Che, H. Tuan","doi":"10.1109/ICSPCS.2013.6723961","DOIUrl":null,"url":null,"abstract":"In this paper, we are concerned with optimized linear precoding strategies for multiple-input multiple-output interference channels (MIMO-IFC). Under practical transmission power constraints, we aim at maximizing the sum-information-rate. To date, most developments could not directly address this problem. Instead, intermediate problems of simplification have been considered by means of alternating optimization, which fails to jointly optimize all the concerned variables. In this paper, we directly solve this problem by exploring its hidden d.c. (difference of convex functions) structure. The recast problem can be iteratively solved by d.c. iterations (DCIs), which guarantees the convergence to at least a local optimum. Numerical simulation results show that the proposed solutions offer improved performance.","PeriodicalId":294442,"journal":{"name":"2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimized linear precoder in MIMO interference channel using D.C. programming\",\"authors\":\"H. H. M. Tam, E. Che, H. Tuan\",\"doi\":\"10.1109/ICSPCS.2013.6723961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we are concerned with optimized linear precoding strategies for multiple-input multiple-output interference channels (MIMO-IFC). Under practical transmission power constraints, we aim at maximizing the sum-information-rate. To date, most developments could not directly address this problem. Instead, intermediate problems of simplification have been considered by means of alternating optimization, which fails to jointly optimize all the concerned variables. In this paper, we directly solve this problem by exploring its hidden d.c. (difference of convex functions) structure. The recast problem can be iteratively solved by d.c. iterations (DCIs), which guarantees the convergence to at least a local optimum. Numerical simulation results show that the proposed solutions offer improved performance.\",\"PeriodicalId\":294442,\"journal\":{\"name\":\"2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSPCS.2013.6723961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSPCS.2013.6723961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimized linear precoder in MIMO interference channel using D.C. programming
In this paper, we are concerned with optimized linear precoding strategies for multiple-input multiple-output interference channels (MIMO-IFC). Under practical transmission power constraints, we aim at maximizing the sum-information-rate. To date, most developments could not directly address this problem. Instead, intermediate problems of simplification have been considered by means of alternating optimization, which fails to jointly optimize all the concerned variables. In this paper, we directly solve this problem by exploring its hidden d.c. (difference of convex functions) structure. The recast problem can be iteratively solved by d.c. iterations (DCIs), which guarantees the convergence to at least a local optimum. Numerical simulation results show that the proposed solutions offer improved performance.