Yang Zhang, Zheng Zhou, Yuhang Jia, Bin Li, Zhichao Qin
{"title":"Efficient codeword search algorithm for limited feedback MIMO beamforming systems","authors":"Yang Zhang, Zheng Zhou, Yuhang Jia, Bin Li, Zhichao Qin","doi":"10.1109/ISCIT.2013.6645812","DOIUrl":null,"url":null,"abstract":"We present an efficient codeword search algorithm for limited feedback MIMO beamforming systems. Given a predefined codebook, identifying the best beamforming codeword may easily become inefficient in terms of computational complexity. To reduce the computational complexity during the codeword searching process, we propose a novel (off-line) preprocessing scheme, which specifies the feasible condition for efficient searching. By exploiting the triangle inequality principle for distance, we develop a promising kick-out condition to avoid computing the chordal distance in the presence of non-optimal codewords of the input vector. Numerical experimental results have shown that the computational burden of our proposed algorithm has been significantly reduced compared with the traditional exhaustive search.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2013.6645812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present an efficient codeword search algorithm for limited feedback MIMO beamforming systems. Given a predefined codebook, identifying the best beamforming codeword may easily become inefficient in terms of computational complexity. To reduce the computational complexity during the codeword searching process, we propose a novel (off-line) preprocessing scheme, which specifies the feasible condition for efficient searching. By exploiting the triangle inequality principle for distance, we develop a promising kick-out condition to avoid computing the chordal distance in the presence of non-optimal codewords of the input vector. Numerical experimental results have shown that the computational burden of our proposed algorithm has been significantly reduced compared with the traditional exhaustive search.