Tao Sun, Jian-hua Zhang, Gang Deng, Chi Zhang, Yuquan Shu
{"title":"三维MU-MIMO系统中块对角化算法的低复杂度实现","authors":"Tao Sun, Jian-hua Zhang, Gang Deng, Chi Zhang, Yuquan Shu","doi":"10.1109/ICCCHINA.2014.7008367","DOIUrl":null,"url":null,"abstract":"In three dimension multiple-input multiple-output (3D MIMO) systems, large number of antennas are arranged at base station (BS) to obtain high spectral efficiency and large throughput. But increase of BS antennas also enhances the computational complexity of the multiuser precoding algorithm such as block diagonalization (BD) significantly. For the dimension increase of channel matrix, various ways can be chosen to obtain the equivalent matrix which can eliminate the user interference completely in the regular BD algorithm. Motivated by this observation, a low complexity precoding method based BD is proposed in this paper, which can simplify the procedure of the two singular value decomposition (SVD) operations in the regular BD algorithm prominently with the optimal equivalent matrix. Also with the 3D channel measurement data we validate the 3D capacity performance of the proposed method. Simulation results show that the proposed method can achieve the same capacity as the regular BD algorithm.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low complexity implementation of block diagonalization algorithm in 3D MU-MIMO systems\",\"authors\":\"Tao Sun, Jian-hua Zhang, Gang Deng, Chi Zhang, Yuquan Shu\",\"doi\":\"10.1109/ICCCHINA.2014.7008367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In three dimension multiple-input multiple-output (3D MIMO) systems, large number of antennas are arranged at base station (BS) to obtain high spectral efficiency and large throughput. But increase of BS antennas also enhances the computational complexity of the multiuser precoding algorithm such as block diagonalization (BD) significantly. For the dimension increase of channel matrix, various ways can be chosen to obtain the equivalent matrix which can eliminate the user interference completely in the regular BD algorithm. Motivated by this observation, a low complexity precoding method based BD is proposed in this paper, which can simplify the procedure of the two singular value decomposition (SVD) operations in the regular BD algorithm prominently with the optimal equivalent matrix. Also with the 3D channel measurement data we validate the 3D capacity performance of the proposed method. Simulation results show that the proposed method can achieve the same capacity as the regular BD algorithm.\",\"PeriodicalId\":353402,\"journal\":{\"name\":\"2014 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCHINA.2014.7008367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2014.7008367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low complexity implementation of block diagonalization algorithm in 3D MU-MIMO systems
In three dimension multiple-input multiple-output (3D MIMO) systems, large number of antennas are arranged at base station (BS) to obtain high spectral efficiency and large throughput. But increase of BS antennas also enhances the computational complexity of the multiuser precoding algorithm such as block diagonalization (BD) significantly. For the dimension increase of channel matrix, various ways can be chosen to obtain the equivalent matrix which can eliminate the user interference completely in the regular BD algorithm. Motivated by this observation, a low complexity precoding method based BD is proposed in this paper, which can simplify the procedure of the two singular value decomposition (SVD) operations in the regular BD algorithm prominently with the optimal equivalent matrix. Also with the 3D channel measurement data we validate the 3D capacity performance of the proposed method. Simulation results show that the proposed method can achieve the same capacity as the regular BD algorithm.