...
首页> 外文期刊>Mathematical Problems in Engineering >Improved Computing-Efficiency Least-Squares Algorithm with Application to All-Pass Filter Design
【24h】

Improved Computing-Efficiency Least-Squares Algorithm with Application to All-Pass Filter Design

机译:改进的计算效率最小二乘算法及其在全通滤波器设计中的应用

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

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

       

摘要

All-pass filter design can be generally achieved by solving a system of linear equations. The associated matrices involved in the set of linear equations can be further formulated as a Toeplitz-plus-Hankel form such that a matrix inversion is avoided. Consequently, the optimal filter coefficients can be solved by using computationally efficient Levinson algorithms or Cholesky decomposition technique. In this paper, based on trigonometric identities and sampling the frequency band of interest uniformly, the authors proposed closed-form expressions to compute the elements of the Toeplitz-plus-Hankel matrix required in the least-squares design of ⅡR all-pass filters. Simulation results confirm that the proposed method achieves good performance as well as effectiveness.
机译:通常可以通过求解线性方程组来实现全通滤波器设计。线性方程组中涉及的相关矩阵可以进一步公式化为Toeplitz plus-Hankel形式,从而避免了矩阵求逆。因此,可以通过使用计算效率高的Levinson算法或Cholesky分解技术来求解最佳滤波器系数。本文基于三角恒等式,对感兴趣的频带进行均匀采样,提出了封闭形式的表达式来计算ⅡR全通滤波器的最小二乘设计中所需的Toeplitz + Hankel矩阵的元素。仿真结果表明,该方法具有良好的性能和有效性。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2013年第7期|249021.1-249021.8|共8页
  • 作者单位

    Department of Computer and Information Science, R.O.C. Military Academy, Fengshan District, Kaohsiung 830, Taiwan;

    Department of Electrical Engineering, R.O.C. Military Academy, P.O. Box 90602-6, Fengshan District, Kaohsiung 830, Taiwan;

    Department of Computer Science and Information Engineering, Southern Taiwan University of Science and Technology,Yongkang District, Tainan 710, Taiwan;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号