Solving of Inverse Z-Transfer Function by Recurrent Permutation Method

摘要

In general, a lot of matrix manipulations are needed to find an inverse Z-transfer function. Basically, a total of KTxNxN times of multiplications, exclusive of additions, are required for a N-order inverse Z-transfer function to get results for KT discrete points. In this article, an efficient method which, taking good advantage of the characteristics of the matrix formed with the transfer function coefficients, can reduce multiplications and additions to only 2xKTxN times for the same amount of results is proposed. This approach is called Recurrent Permutation Method. It can save a lot of computer time by significantly reducing the multiplications needed. As multiplications in the linear domain are equivalent to additions in the logarithmic domain, the algorithms developed in both domains are included in a computer program. The choice based on the characteristics of the desired applications is left to the user. (ERA citation 09:050978)