{"title":"恒模混合递推和最小均方算法的性能可与无气味卡尔曼滤波相媲美","authors":"V. Ranganathan, G. Prabha, K. Narayanankutty","doi":"10.1109/INDICON.2016.7838889","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an adaptive filtering algorithm, Hybrid Recursive and Least Mean Square-based Constant Modulus Algorithm (RLS-LMS-CMA) for optimized blind beamforming for a Uniform Linear Array (ULA). We consider that Recursive Least Square-based Constant Modulus Algorithm (RLS-CMA) and Least Mean Square-based Constant Modulus Algorithm (LMS-CMA) algorithms are time tested. Therefore, we investigated a combination of RLS-LMS-CMA algorithm. We achieve similar tracking performance when compared to Unscented Kalman Filter-based Constant Modulus Algorithm (UKF-CMA) with minimal computational complexity. Simulations are carried out to compare the performance of RLS-LMS-CMA with other state-of-the-art algorithms. Results obtained indicate that proposed algorithm leads to an equivalent tracking ability and convergence rate of UKF-CMA algorithm.","PeriodicalId":283953,"journal":{"name":"2016 IEEE Annual India Conference (INDICON)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Constant modulus hybrid recursive and least mean squared algorithm performance comparable to unscented Kalman filter for blind beamforming\",\"authors\":\"V. Ranganathan, G. Prabha, K. Narayanankutty\",\"doi\":\"10.1109/INDICON.2016.7838889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an adaptive filtering algorithm, Hybrid Recursive and Least Mean Square-based Constant Modulus Algorithm (RLS-LMS-CMA) for optimized blind beamforming for a Uniform Linear Array (ULA). We consider that Recursive Least Square-based Constant Modulus Algorithm (RLS-CMA) and Least Mean Square-based Constant Modulus Algorithm (LMS-CMA) algorithms are time tested. Therefore, we investigated a combination of RLS-LMS-CMA algorithm. We achieve similar tracking performance when compared to Unscented Kalman Filter-based Constant Modulus Algorithm (UKF-CMA) with minimal computational complexity. Simulations are carried out to compare the performance of RLS-LMS-CMA with other state-of-the-art algorithms. Results obtained indicate that proposed algorithm leads to an equivalent tracking ability and convergence rate of UKF-CMA algorithm.\",\"PeriodicalId\":283953,\"journal\":{\"name\":\"2016 IEEE Annual India Conference (INDICON)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Annual India Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDICON.2016.7838889\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Annual India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2016.7838889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constant modulus hybrid recursive and least mean squared algorithm performance comparable to unscented Kalman filter for blind beamforming
In this paper, we propose an adaptive filtering algorithm, Hybrid Recursive and Least Mean Square-based Constant Modulus Algorithm (RLS-LMS-CMA) for optimized blind beamforming for a Uniform Linear Array (ULA). We consider that Recursive Least Square-based Constant Modulus Algorithm (RLS-CMA) and Least Mean Square-based Constant Modulus Algorithm (LMS-CMA) algorithms are time tested. Therefore, we investigated a combination of RLS-LMS-CMA algorithm. We achieve similar tracking performance when compared to Unscented Kalman Filter-based Constant Modulus Algorithm (UKF-CMA) with minimal computational complexity. Simulations are carried out to compare the performance of RLS-LMS-CMA with other state-of-the-art algorithms. Results obtained indicate that proposed algorithm leads to an equivalent tracking ability and convergence rate of UKF-CMA algorithm.