{"title":"一类频率估计算法的理论框架","authors":"R. Todd, J. R. Cruz","doi":"10.1109/SSAP.1992.246869","DOIUrl":null,"url":null,"abstract":"This paper discusses a general class of algorithms for estimating the frequencies of a set of complex exponentials, and presents a corrected proof of the validity of the algorithms when applied to either real or complex data. The linear-prediction least-squares algorithms, involve the formulation of the estimation problem in terms of finding the roots of a polynomial in C(x) (the vector space of polynomials over the complex numbers C) that has minimum norm with respect to some inner product defined over C(x).<<ETX>>","PeriodicalId":309407,"journal":{"name":"[1992] IEEE Sixth SP Workshop on Statistical Signal and Array Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A theoretical framework for a class of frequency estimation algorithms\",\"authors\":\"R. Todd, J. R. Cruz\",\"doi\":\"10.1109/SSAP.1992.246869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses a general class of algorithms for estimating the frequencies of a set of complex exponentials, and presents a corrected proof of the validity of the algorithms when applied to either real or complex data. The linear-prediction least-squares algorithms, involve the formulation of the estimation problem in terms of finding the roots of a polynomial in C(x) (the vector space of polynomials over the complex numbers C) that has minimum norm with respect to some inner product defined over C(x).<<ETX>>\",\"PeriodicalId\":309407,\"journal\":{\"name\":\"[1992] IEEE Sixth SP Workshop on Statistical Signal and Array Processing\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] IEEE Sixth SP Workshop on Statistical Signal and Array Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSAP.1992.246869\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] IEEE Sixth SP Workshop on Statistical Signal and Array Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSAP.1992.246869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A theoretical framework for a class of frequency estimation algorithms
This paper discusses a general class of algorithms for estimating the frequencies of a set of complex exponentials, and presents a corrected proof of the validity of the algorithms when applied to either real or complex data. The linear-prediction least-squares algorithms, involve the formulation of the estimation problem in terms of finding the roots of a polynomial in C(x) (the vector space of polynomials over the complex numbers C) that has minimum norm with respect to some inner product defined over C(x).<>