Nicola Varanese, O. Simeone, Y. Bar-Ness, U. Spagnolini
{"title":"具有完整CSI的多跳和协同MIMO放大和转发中继系统的可实现速率","authors":"Nicola Varanese, O. Simeone, Y. Bar-Ness, U. Spagnolini","doi":"10.1109/SPAWC.2006.346423","DOIUrl":null,"url":null,"abstract":"In this paper, two types of MIMO amplify-and-forward relay systems are considered: multi-hop and cooperative. For both cases, the problem of maximizing the achievable rate over the covariance matrices of the symbols transmitted by the source and relay linear processing matrix is formulated under the assumption of full channel state information at each node. A sub-optimal iterative algorithm is proposed and proved by numerical simulations to outperform known schemes","PeriodicalId":414942,"journal":{"name":"2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Achievable Rates of Multi-Hop and Cooperative MIMO Amplify-and-Forward Relay Systems with Full CSI\",\"authors\":\"Nicola Varanese, O. Simeone, Y. Bar-Ness, U. Spagnolini\",\"doi\":\"10.1109/SPAWC.2006.346423\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, two types of MIMO amplify-and-forward relay systems are considered: multi-hop and cooperative. For both cases, the problem of maximizing the achievable rate over the covariance matrices of the symbols transmitted by the source and relay linear processing matrix is formulated under the assumption of full channel state information at each node. A sub-optimal iterative algorithm is proposed and proved by numerical simulations to outperform known schemes\",\"PeriodicalId\":414942,\"journal\":{\"name\":\"2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2006.346423\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2006.346423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Achievable Rates of Multi-Hop and Cooperative MIMO Amplify-and-Forward Relay Systems with Full CSI
In this paper, two types of MIMO amplify-and-forward relay systems are considered: multi-hop and cooperative. For both cases, the problem of maximizing the achievable rate over the covariance matrices of the symbols transmitted by the source and relay linear processing matrix is formulated under the assumption of full channel state information at each node. A sub-optimal iterative algorithm is proposed and proved by numerical simulations to outperform known schemes