{"title":"A Comparative Analysis of ML-based DOA Estimators","authors":"D. Orlando, G. Ricci","doi":"10.1109/MetroAeroSpace57412.2023.10190024","DOIUrl":null,"url":null,"abstract":"This paper compares different directions of arrival estimation techniques relying on the maximum likelihood (ML) principle. The considered algorithms are well-known, but to the best of authors' knowledge a thorough comparison has not be performed in the open literature. This is especially true for the unconditional maximum likelihood (UML) and the asymptotic maximum likelihood (AML) algorithms. The UML is the ML estimator when source signals are sample functions drawn from zero-mean complex Gaussian processes and the noise is a white Gaussian process; on the other hand, the AML is an approximated ML that tends to the UML as the number of snapshots $K$ increases towards infinity. In [1], it is stated that for a uniform linear array with $N$ elements the performance of the two algorithms are essentially the same as $K\\geq 10N$. However, we will show that the two algorithms may have different performance for lower sample supports.","PeriodicalId":153093,"journal":{"name":"2023 IEEE 10th International Workshop on Metrology for AeroSpace (MetroAeroSpace)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 10th International Workshop on Metrology for AeroSpace (MetroAeroSpace)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MetroAeroSpace57412.2023.10190024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper compares different directions of arrival estimation techniques relying on the maximum likelihood (ML) principle. The considered algorithms are well-known, but to the best of authors' knowledge a thorough comparison has not be performed in the open literature. This is especially true for the unconditional maximum likelihood (UML) and the asymptotic maximum likelihood (AML) algorithms. The UML is the ML estimator when source signals are sample functions drawn from zero-mean complex Gaussian processes and the noise is a white Gaussian process; on the other hand, the AML is an approximated ML that tends to the UML as the number of snapshots $K$ increases towards infinity. In [1], it is stated that for a uniform linear array with $N$ elements the performance of the two algorithms are essentially the same as $K\geq 10N$. However, we will show that the two algorithms may have different performance for lower sample supports.