{"title":"一种新的最大似然频率估计循环算法","authors":"A. Shaw","doi":"10.1109/ICSYSE.1991.161165","DOIUrl":null,"url":null,"abstract":"An algorithm for estimation of frequencies of narrowband sources from noisy observation data is presented. For Gaussianly distributed noise, the algorithm produces maximum likelihood estimates, otherwise least-squares estimates, are obtained. The proposed algorithm is iterative, and at each step of iteration the optimization is with respect to a single frequency only, and hence simple hardware/software is sufficient for implementation. The performance of the algorithm has been compared with theoretical Cramer-Rao bounds.<<ETX>>","PeriodicalId":250037,"journal":{"name":"IEEE 1991 International Conference on Systems Engineering","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A novel cyclic algorithm for maximum likelihood frequency estimation\",\"authors\":\"A. Shaw\",\"doi\":\"10.1109/ICSYSE.1991.161165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm for estimation of frequencies of narrowband sources from noisy observation data is presented. For Gaussianly distributed noise, the algorithm produces maximum likelihood estimates, otherwise least-squares estimates, are obtained. The proposed algorithm is iterative, and at each step of iteration the optimization is with respect to a single frequency only, and hence simple hardware/software is sufficient for implementation. The performance of the algorithm has been compared with theoretical Cramer-Rao bounds.<<ETX>>\",\"PeriodicalId\":250037,\"journal\":{\"name\":\"IEEE 1991 International Conference on Systems Engineering\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE 1991 International Conference on Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSYSE.1991.161165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE 1991 International Conference on Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSYSE.1991.161165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel cyclic algorithm for maximum likelihood frequency estimation
An algorithm for estimation of frequencies of narrowband sources from noisy observation data is presented. For Gaussianly distributed noise, the algorithm produces maximum likelihood estimates, otherwise least-squares estimates, are obtained. The proposed algorithm is iterative, and at each step of iteration the optimization is with respect to a single frequency only, and hence simple hardware/software is sufficient for implementation. The performance of the algorithm has been compared with theoretical Cramer-Rao bounds.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
