Efficient Algorithms of Direct and Inverse First-Order S-Z Transformations

摘要

In the article, we describe principles of numerical algorithms by means of which coefficients of continuous-time and discrete-time frequency filters are possible to transform each other for several s-z trans-formations. The basis of algorithms is so-called Pascal matrix for calculation of which an original procedure is used. We discuss problems of numerical conditionality of Pascal matrix and possibility of its practical usage. Illustrative examples of numerical calculations programmed in Matlab 5.1 are the constituent part of the article.