一种改进的基于lsf的最大似然性能正弦频率估计算法

P. Vishnu, C. S. Ramalingam
{"title":"一种改进的基于lsf的最大似然性能正弦频率估计算法","authors":"P. Vishnu, C. S. Ramalingam","doi":"10.1109/SPCOM50965.2020.9179546","DOIUrl":null,"url":null,"abstract":"In this paper we propose a method for sinusoidal frequency estimation that improves upon our previously proposed LSF-based algorithm that used at most 5p candidate points, where p is the number of sinusoids present. In this paper we propose the following improvements: (i) reduced the number of candidate frequencies to at most 2p points, (ii) reduced the method’s threshold to equal that of ML, and (iii) reduced the computational burden by switching to methods like ESPRIT when the SNR is above threshold. Since neither the SNR nor the threshold is known, we estimate them from the data. The proposed reduction-in-threshold step can be applied to EPUMA (proposed Qian et al.), with which we compare our results. For the well-known two-sinusoid example the proposed method has the same threshold as that of ML; ML performance is also achieved when tested on a new, three-sinusoid example.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Improved LSF-based Algorithm for Sinusoidal Frequency Estimation that Achieves Maximum Likelihood Performance\",\"authors\":\"P. Vishnu, C. S. Ramalingam\",\"doi\":\"10.1109/SPCOM50965.2020.9179546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a method for sinusoidal frequency estimation that improves upon our previously proposed LSF-based algorithm that used at most 5p candidate points, where p is the number of sinusoids present. In this paper we propose the following improvements: (i) reduced the number of candidate frequencies to at most 2p points, (ii) reduced the method’s threshold to equal that of ML, and (iii) reduced the computational burden by switching to methods like ESPRIT when the SNR is above threshold. Since neither the SNR nor the threshold is known, we estimate them from the data. The proposed reduction-in-threshold step can be applied to EPUMA (proposed Qian et al.), with which we compare our results. For the well-known two-sinusoid example the proposed method has the same threshold as that of ML; ML performance is also achieved when tested on a new, three-sinusoid example.\",\"PeriodicalId\":208527,\"journal\":{\"name\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"volume\":\"186 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPCOM50965.2020.9179546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Signal Processing and Communications (SPCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM50965.2020.9179546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们提出了一种正弦频率估计方法,该方法改进了我们之前提出的基于lsf的算法,该算法最多使用5p个候选点,其中p是存在的正弦波数。在本文中,我们提出了以下改进:(i)将候选频率的数量减少到最多2p个点,(ii)将方法的阈值降低到与ML相等,(iii)当信噪比高于阈值时,通过切换到ESPRIT等方法来减少计算负担。由于信噪比和阈值都不知道,我们从数据中估计它们。所提出的阈值还原步骤可以应用于EPUMA (Qian等人提出的),我们将其与我们的结果进行比较。对于众所周知的双正弦例子,所提出的方法具有与ML相同的阈值;当在一个新的三正弦示例上进行测试时,也实现了ML性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved LSF-based Algorithm for Sinusoidal Frequency Estimation that Achieves Maximum Likelihood Performance
In this paper we propose a method for sinusoidal frequency estimation that improves upon our previously proposed LSF-based algorithm that used at most 5p candidate points, where p is the number of sinusoids present. In this paper we propose the following improvements: (i) reduced the number of candidate frequencies to at most 2p points, (ii) reduced the method’s threshold to equal that of ML, and (iii) reduced the computational burden by switching to methods like ESPRIT when the SNR is above threshold. Since neither the SNR nor the threshold is known, we estimate them from the data. The proposed reduction-in-threshold step can be applied to EPUMA (proposed Qian et al.), with which we compare our results. For the well-known two-sinusoid example the proposed method has the same threshold as that of ML; ML performance is also achieved when tested on a new, three-sinusoid example.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Wavelet based Fine-to-Coarse Retinal Blood Vessel Extraction using U-net Model Classification of Social Signals Using Deep LSTM-based Recurrent Neural Networks Classifying Cultural Music using Melodic Features Clustering tendency assessment for datasets having inter-cluster density variations Component-specific temporal decomposition: application to enhanced speech coding and co-articulation analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1