{"title":"基于稀疏预估计自适应匹配跟踪算法的DOA估计","authors":"Huijing Dou, Dongxu Xie, W. Guo","doi":"10.1145/3581807.3581863","DOIUrl":null,"url":null,"abstract":"The traditional subspace class algorithm has low or even no estimation accuracy for DOA estimation under the conditions of less number of snapshots, low SNR and source coherence. Therefore, the application of compressed sensing theory in DOA estimation is studied in this paper. To address the problems of poor estimation accuracy of sparsity adaptive matching Pursuit(SAMP) algorithm in noisy environment and the need to gradually approximate the true sparsity from zero, a sparsity pre-estimation adaptive matching Pursuit(SPAMP) algorithm is proposed in this paper . The algorithm in this paper optimizes the iterative termination conditions of the algorithm by using the changing rules of iterative residuals, and at the same time approximates the source sparsity quickly and accurately by pre-estimating the initial sparsity.. The simulation results show that the algorithm in this paper has the advantages of high estimation accuracy, fast operation speed and better noise immunity, which promotes further integration of compressed sensing and DOA estimation in practical situations.","PeriodicalId":292813,"journal":{"name":"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition","volume":"358 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DOA Estimation Based on a Sparsity Pre-estimation Adaptive Matching Pursuit Algorithm\",\"authors\":\"Huijing Dou, Dongxu Xie, W. Guo\",\"doi\":\"10.1145/3581807.3581863\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traditional subspace class algorithm has low or even no estimation accuracy for DOA estimation under the conditions of less number of snapshots, low SNR and source coherence. Therefore, the application of compressed sensing theory in DOA estimation is studied in this paper. To address the problems of poor estimation accuracy of sparsity adaptive matching Pursuit(SAMP) algorithm in noisy environment and the need to gradually approximate the true sparsity from zero, a sparsity pre-estimation adaptive matching Pursuit(SPAMP) algorithm is proposed in this paper . The algorithm in this paper optimizes the iterative termination conditions of the algorithm by using the changing rules of iterative residuals, and at the same time approximates the source sparsity quickly and accurately by pre-estimating the initial sparsity.. The simulation results show that the algorithm in this paper has the advantages of high estimation accuracy, fast operation speed and better noise immunity, which promotes further integration of compressed sensing and DOA estimation in practical situations.\",\"PeriodicalId\":292813,\"journal\":{\"name\":\"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition\",\"volume\":\"358 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3581807.3581863\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 11th International Conference on Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3581807.3581863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
DOA Estimation Based on a Sparsity Pre-estimation Adaptive Matching Pursuit Algorithm
The traditional subspace class algorithm has low or even no estimation accuracy for DOA estimation under the conditions of less number of snapshots, low SNR and source coherence. Therefore, the application of compressed sensing theory in DOA estimation is studied in this paper. To address the problems of poor estimation accuracy of sparsity adaptive matching Pursuit(SAMP) algorithm in noisy environment and the need to gradually approximate the true sparsity from zero, a sparsity pre-estimation adaptive matching Pursuit(SPAMP) algorithm is proposed in this paper . The algorithm in this paper optimizes the iterative termination conditions of the algorithm by using the changing rules of iterative residuals, and at the same time approximates the source sparsity quickly and accurately by pre-estimating the initial sparsity.. The simulation results show that the algorithm in this paper has the advantages of high estimation accuracy, fast operation speed and better noise immunity, which promotes further integration of compressed sensing and DOA estimation in practical situations.