{"title":"高相关波前一种新的降低复杂度的到达方向估计方法","authors":"C. Lagarde, D. Grenier","doi":"10.1109/CCECE.1997.614829","DOIUrl":null,"url":null,"abstract":"In this paper, we present a complexity reduced version of the DEESE algorithm proposed by D. Grenier (1996) for direction-of-arrival estimation of highly correlated wave fronts with an uniform linear antenna array. The DEESE algorithm resides in applying a preprocessing to the estimated spatial correlation matrix before using the MUSIC method, which implies an eigenvalue decomposition of the correlation matrix. We will show that such a preprocessing can be applied directly to the sample vectors. This allows to significantly reduce the dimension of the eigenvalue problem and hence, to significantly reduce the execution time of the algorithm. Despite its reduced complexity, our algorithm gives better performances than the common spatial smoothing method.","PeriodicalId":359446,"journal":{"name":"CCECE '97. Canadian Conference on Electrical and Computer Engineering. Engineering Innovation: Voyage of Discovery. Conference Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new complexity reduced direction-of-arrival estimation method for highly correlated wave fronts\",\"authors\":\"C. Lagarde, D. Grenier\",\"doi\":\"10.1109/CCECE.1997.614829\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a complexity reduced version of the DEESE algorithm proposed by D. Grenier (1996) for direction-of-arrival estimation of highly correlated wave fronts with an uniform linear antenna array. The DEESE algorithm resides in applying a preprocessing to the estimated spatial correlation matrix before using the MUSIC method, which implies an eigenvalue decomposition of the correlation matrix. We will show that such a preprocessing can be applied directly to the sample vectors. This allows to significantly reduce the dimension of the eigenvalue problem and hence, to significantly reduce the execution time of the algorithm. Despite its reduced complexity, our algorithm gives better performances than the common spatial smoothing method.\",\"PeriodicalId\":359446,\"journal\":{\"name\":\"CCECE '97. Canadian Conference on Electrical and Computer Engineering. Engineering Innovation: Voyage of Discovery. Conference Proceedings\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CCECE '97. Canadian Conference on Electrical and Computer Engineering. Engineering Innovation: Voyage of Discovery. Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.1997.614829\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CCECE '97. Canadian Conference on Electrical and Computer Engineering. Engineering Innovation: Voyage of Discovery. Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.1997.614829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new complexity reduced direction-of-arrival estimation method for highly correlated wave fronts
In this paper, we present a complexity reduced version of the DEESE algorithm proposed by D. Grenier (1996) for direction-of-arrival estimation of highly correlated wave fronts with an uniform linear antenna array. The DEESE algorithm resides in applying a preprocessing to the estimated spatial correlation matrix before using the MUSIC method, which implies an eigenvalue decomposition of the correlation matrix. We will show that such a preprocessing can be applied directly to the sample vectors. This allows to significantly reduce the dimension of the eigenvalue problem and hence, to significantly reduce the execution time of the algorithm. Despite its reduced complexity, our algorithm gives better performances than the common spatial smoothing method.