一种使用十进制算法计算LSP频率的两级方法

Jau-Hung Chen, Chung-Hsien Wu, Jhing-Fa Wang
{"title":"一种使用十进制算法计算LSP频率的两级方法","authors":"Jau-Hung Chen, Chung-Hsien Wu, Jhing-Fa Wang","doi":"10.1109/APCCAS.1994.514583","DOIUrl":null,"url":null,"abstract":"A two-level method is proposed in this study for rapidly and accurately computing the line spectrum pair (LSP) frequencies. An efficient decimation-in-degree (DID) algorithm is also proposed in the first level which can transform any symmetric or antisymmetric polynomial with real coefficients into the other polynomials with lower degrees and without any transcendental functions. The DID algorithm not only can avoid prior storage or large calculation of transcendental functions but can also be easily applied towards those fast root-finding methods. In the second level, the Newton-Raphson method is applied. The process of the Newton-Raphson method can be accelerated by adopting a deflation scheme along with the interlacing property of LSP frequencies for selecting the better initial values. A few conventional numerical methods are also implemented to make a comparison with the two-level method. Experimental results indicate that the two-level method is the fastest one.","PeriodicalId":231368,"journal":{"name":"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A two-level method using a decimation-in-degree algorithm for the computation of the LSP frequencies\",\"authors\":\"Jau-Hung Chen, Chung-Hsien Wu, Jhing-Fa Wang\",\"doi\":\"10.1109/APCCAS.1994.514583\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A two-level method is proposed in this study for rapidly and accurately computing the line spectrum pair (LSP) frequencies. An efficient decimation-in-degree (DID) algorithm is also proposed in the first level which can transform any symmetric or antisymmetric polynomial with real coefficients into the other polynomials with lower degrees and without any transcendental functions. The DID algorithm not only can avoid prior storage or large calculation of transcendental functions but can also be easily applied towards those fast root-finding methods. In the second level, the Newton-Raphson method is applied. The process of the Newton-Raphson method can be accelerated by adopting a deflation scheme along with the interlacing property of LSP frequencies for selecting the better initial values. A few conventional numerical methods are also implemented to make a comparison with the two-level method. Experimental results indicate that the two-level method is the fastest one.\",\"PeriodicalId\":231368,\"journal\":{\"name\":\"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCCAS.1994.514583\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.1994.514583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种快速准确地计算线谱对频率的两级方法。在第一级提出了一种有效的次数抽取(DID)算法,该算法可以将任意具有实系数的对称或反对称多项式转化为具有较低次数且不需要任何超越函数的多项式。DID算法不仅可以避免先验函数的预先存储和大量的计算,而且可以很容易地应用于那些快速查找根的方法。在第二层,应用牛顿-拉夫森方法。采用一种利用LSP频率的交错特性选择较优初值的压缩方案,可以加快Newton-Raphson方法的求解速度。本文还采用了几种传统的数值方法,并与两级法进行了比较。实验结果表明,两级方法是最快的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A two-level method using a decimation-in-degree algorithm for the computation of the LSP frequencies
A two-level method is proposed in this study for rapidly and accurately computing the line spectrum pair (LSP) frequencies. An efficient decimation-in-degree (DID) algorithm is also proposed in the first level which can transform any symmetric or antisymmetric polynomial with real coefficients into the other polynomials with lower degrees and without any transcendental functions. The DID algorithm not only can avoid prior storage or large calculation of transcendental functions but can also be easily applied towards those fast root-finding methods. In the second level, the Newton-Raphson method is applied. The process of the Newton-Raphson method can be accelerated by adopting a deflation scheme along with the interlacing property of LSP frequencies for selecting the better initial values. A few conventional numerical methods are also implemented to make a comparison with the two-level method. Experimental results indicate that the two-level method is the fastest one.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Area-time optimal digital BiCMOS carry look-ahead adder Hierarchical circuit optimization for analog LSIs using device model refining Decomposition-based 2-D variable digital filter design Artificial neural networks-learning and generalization Nonlinear gradient-based edge detection algorithms in the telesign system
×
引用
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