首页> 外文会议>Audio Engineering Society convention >A highly optimized nonlinear least squares technique for sinusoidal analysis: From O(K~2N) to O(N log(N))
【24h】

A highly optimized nonlinear least squares technique for sinusoidal analysis: From O(K~2N) to O(N log(N))

机译:用于正弦分析的高度优化的非线性最小二乘法:从O(K〜2N)到O(N log(N))

获取原文

摘要

In the field of sinusoidal modelling, two types of least squares amplitude estimation methods are distinguished. A first group of methods estimate the complex amplitude of each sinusoid in an iterative manner. Although their main disadvantage is that they are unable to resolve overlapping frequency responses, they are used frequently because of their computational complexity being O(N log(N)). By contrast, methods that compute all amplitudes simultaneously can resolve overlapping frequency responses but their computational complexity scales with a power of three in function of the number of sinusoidal components. In this work a method is proposed which allows to compute all amplitudes simultaneously and still has an G(N log(N)) complexity. This is realized by explicitly including a window with a bandlimited frequency response in the least squares derivation resulting in a band diagonal system of equations which can be solved in linear time. Since overlapping frequency responses are allowed, an iterative method must be used to optimize the frequencies resulting in a nonlinear least squares technique. A commonly used technique is Newton optimization which requires the computation of the gradient and the Hessian matrix. Also here, the same computational gain is realized by applying the same methodology.
机译:在正弦建模领域,区分了两种类型的最小二乘幅度估计方法。第一组方法以迭代方式估计每个正弦波的复振幅。尽管它们的主要缺点是它们无法解析重叠的频率响应,但由于其计算复杂度为O(N log(N)),因此经常使用它们。相比之下,同时计算所有幅度的方法可以解决重叠的频率响应,但是其计算复杂度是正弦分量数量的三倍。在这项工作中,提出了一种方法,该方法允许同时计算所有幅度,并且仍然具有G(N log(N))复杂度。这是通过在最小二乘推导中明确包括一个具有带限频率响应的窗口来实现的,从而得到可以在线性时间内求解的方程的带对角线系统。由于允许重叠的频率响应,因此必须使用迭代方法来优化频率,从而产生非线性最小二乘技术。牛顿优化是一种常用的技术,它需要计算梯度和Hessian矩阵。同样在这里,通过应用相同的方法实现了相同的计算增益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号