...
首页> 外文期刊>IEEE Transactions on Signal Processing >Fast orthogonalization algorithm and parallel architecture for AR spectral estimation based on forward-backward linear prediction
【24h】

Fast orthogonalization algorithm and parallel architecture for AR spectral estimation based on forward-backward linear prediction

机译:基于前后线性预测的AR谱估计快速正交算法和并行架构

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Truncated QR methods have been shown to be comparable to SVD-based methods for the sinusoidal frequency estimation based on the forward-backward linear prediction (FBLP) model. However, without exploiting the special structure of the FBLP matrix, the QR decomposition (QRD) of the FBLP matrix has a computational complexity on the order of 2(6m-n)n/sup 2//3+O(n/sup 2/) for a 2m*n FBLP matrix. A fast algorithm to perform the QRD of the FBLP matrix by exploiting its special Toeplitz-Hankel form is proposed. The computational complexity is reduced to 10n/sup 2/+4mn+O(n). The fast algorithm can also be easily implemented by a linear systolic array, reducing the number of time steps required to 2m+5n-4.
机译:截断QR方法已被证明与基于前向后线性预测(FBLP)模型的正弦频率估计的基于SVD的方法相当。但是,在不利用FBLP矩阵的特殊结构的情况下,FBLP矩阵的QR分解(QRD)的计算复杂度约为2(6m-n)n / sup 2 // 3 + O(n / sup 2 /)2m * n FBLP矩阵。提出了一种利用其特殊的Toeplitz-Hankel形式执行FBLP矩阵QRD的快速算法。计算复杂度降低到10n / sup 2 / + 4mn + O(n)。快速算法也可以通过线性脉动阵列轻松实现,从而将所需的时间步数减少到2m + 5n-4。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号