P. Lozano, Victor Manuel Gonzalez Yanez, Pedro Abraham Mejia Orozco
{"title":"左伪逆MIMO信道矩阵计算","authors":"P. Lozano, Victor Manuel Gonzalez Yanez, Pedro Abraham Mejia Orozco","doi":"10.1109/CONIELECOMP.2009.21","DOIUrl":null,"url":null,"abstract":"In the context of MIMO communication systems, an iterative-recursive algorithm for the computation of the matrix left-pseudoinverse is proposed. Several matrix theory properties are considered for computational complexity reductions. The algorithm works properly due to the classic assumptions on the statistical characteristics of the MIMO channel elements. Considerable improvements in the algorithmic complexity regarding this proposal are highlighted.","PeriodicalId":292855,"journal":{"name":"2009 International Conference on Electrical, Communications, and Computers","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Left-Pseudoinverse MIMO Channel Matrix Computation\",\"authors\":\"P. Lozano, Victor Manuel Gonzalez Yanez, Pedro Abraham Mejia Orozco\",\"doi\":\"10.1109/CONIELECOMP.2009.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the context of MIMO communication systems, an iterative-recursive algorithm for the computation of the matrix left-pseudoinverse is proposed. Several matrix theory properties are considered for computational complexity reductions. The algorithm works properly due to the classic assumptions on the statistical characteristics of the MIMO channel elements. Considerable improvements in the algorithmic complexity regarding this proposal are highlighted.\",\"PeriodicalId\":292855,\"journal\":{\"name\":\"2009 International Conference on Electrical, Communications, and Computers\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Electrical, Communications, and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2009.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Electrical, Communications, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2009.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Left-Pseudoinverse MIMO Channel Matrix Computation
In the context of MIMO communication systems, an iterative-recursive algorithm for the computation of the matrix left-pseudoinverse is proposed. Several matrix theory properties are considered for computational complexity reductions. The algorithm works properly due to the classic assumptions on the statistical characteristics of the MIMO channel elements. Considerable improvements in the algorithmic complexity regarding this proposal are highlighted.