{"title":"多用户MIMO下行信道下源中继预编码联合优化","authors":"Wei Xu, Xiaodai Dong, Wu-Sheng Lu","doi":"10.1109/ICC.2010.5501938","DOIUrl":null,"url":null,"abstract":"This paper investigates the joint precoding optimization problem for a relay-assisted multi- antenna downlink system. Aiming at multiuser sum capacity maximization, we first propose an iterative optimization algorithm which exploits quadratic programming approaches. We observe that the iterative method always yields the optimized precoding matrices which diagonalize the compound channel of the system at high SNR regimes. Inspired by this observation, we further develop an efficient source and relay precoding strategy by diagonalizing the compound channel of the backward (source-to- relay) and the forward (relay-to-destination) links. Simulation results verify the effectiveness of our proposed precoding schemes.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Joint Optimization for Source and Relay Precoding under Multiuser MIMO Downlink Channels\",\"authors\":\"Wei Xu, Xiaodai Dong, Wu-Sheng Lu\",\"doi\":\"10.1109/ICC.2010.5501938\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the joint precoding optimization problem for a relay-assisted multi- antenna downlink system. Aiming at multiuser sum capacity maximization, we first propose an iterative optimization algorithm which exploits quadratic programming approaches. We observe that the iterative method always yields the optimized precoding matrices which diagonalize the compound channel of the system at high SNR regimes. Inspired by this observation, we further develop an efficient source and relay precoding strategy by diagonalizing the compound channel of the backward (source-to- relay) and the forward (relay-to-destination) links. Simulation results verify the effectiveness of our proposed precoding schemes.\",\"PeriodicalId\":6405,\"journal\":{\"name\":\"2010 IEEE International Conference on Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2010.5501938\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2010.5501938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Optimization for Source and Relay Precoding under Multiuser MIMO Downlink Channels
This paper investigates the joint precoding optimization problem for a relay-assisted multi- antenna downlink system. Aiming at multiuser sum capacity maximization, we first propose an iterative optimization algorithm which exploits quadratic programming approaches. We observe that the iterative method always yields the optimized precoding matrices which diagonalize the compound channel of the system at high SNR regimes. Inspired by this observation, we further develop an efficient source and relay precoding strategy by diagonalizing the compound channel of the backward (source-to- relay) and the forward (relay-to-destination) links. Simulation results verify the effectiveness of our proposed precoding schemes.