...
首页> 外文期刊>International Journal of Engineering and Technology >Stability Testing of Two Dimensional Recursive Filters Using Mapping Methods
【24h】

Stability Testing of Two Dimensional Recursive Filters Using Mapping Methods

机译:使用映射方法对二维递归滤波器进行稳定性测试

获取原文
           

摘要

The stability testing of first quadrant quarter-plane (QP) two dimensional recursive digital filters had been a classical problem for the last two decades. In literature, the two major types of stability testing methods available are algebraic and mapping methods. Even though the algebraic methods can determine the stability in finite number of steps, it has a few practical limitations in its implementations and it consumes very large time to find the exact stability as it requires larger number of calculations. Moreover, the accuracy of the algebraic methods is also affected by the finite word length effects of the computer. The mapping methods, in general cannot guarantee the stability of given recursive digital filter in finite number of steps as it can determine the stability only in infinite number of steps. Out of the mapping methods, Jury?s row and column algorithms have been considered as highly efficient, even though they still run short of accuracy due to the undefined length of the FFT used. Hence, the best mapping method is not yet available, though some researchers like Bistritz have been working on this problem even now. The main aim of this paper is to find the simple and fast solution for testing the stability of first quadrant quarter-plane two dimensional recursive digital filters. In this work, it is assumed that the given transfer function is devoid of non-essential singularities of second kind. A new mapping stability test procedure for two dimensional quarter-plane recursive digital filter (QP) is proposed which is primarily based on the row and column concatenation method. One important advantage of the proposed test procedure is that it requires single 1-D polynomials to be tested for stability for two dimensional recursive digital filters of any order. This method gives a simple and best solution procedure even for barely stable or barely unstable recursive digital filters. Sufficient examples are taken from the literature for two dimensional recursive digital filters and the same accurate results as that found in the literature are also obtained using this method.
机译:在过去的二十年中,第一象限四分之一平面(QP)二维递归数字滤波器的稳定性测试一直是一个经典问题。在文献中,可用的两种主要的稳定性测试方法是代数和映射方法。即使代数方法可以确定有限步长的稳定性,但它在实现上仍存在一些实际限制,并且由于需要大量计算,因此它会花费大量时间来找到精确的稳定性。此外,计算机的有限字长效应也会影响代数方法的准确性。映射方法通常不能保证有限数目的步长中给定的递归数字滤波器的稳定性,因为它只能确定无限数目的步长中的稳定性。在这些映射方法中,Jury的行和列算法被认为是高效的,尽管由于所用FFT的不确定长度,其精度仍然不足。因此,尽管像Bistritz这样的一些研究人员直到现在仍在研究这个问题,但尚无最佳的映射方法。本文的主要目的是找到一种简单快速的解决方案,以测试第一象限四分之一平面二维递归数字滤波器的稳定性。在这项工作中,假定给定的传递函数没有第二种非必要的奇点。提出了一种新的二维四分之一平面递归数字滤波器(QP)映射稳定性测试程序,该程序主要基于行和列级联方法。所提出的测试过程的一个重要优点是,它需要测试单个一维多项式的稳定性,以用于任意阶数的二维递归数字滤波器。即使对于几乎稳定或几乎不稳定的递归数字滤波器,此方法也提供了一种简单而最佳的解决方法。从文献中获得了足够的二维递归数字滤波器示例,并且使用此方法也可以获得与文献中相同的准确结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号