Abstract

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z−1, which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z−i by time functions, which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of zi at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.

Highlights

  • Received: 24 January 2021Accepted: 16 February 2021Published: 10 March 2021The introduction of a time-varying z-transform for the study of linear time-varying discrete-time systems or digital filters goes back to the discrete-time counterpart of theZadeh system function, which first appeared in [1]

  • It is this property along with the left-shift property that converts signals or two-variable time functions given by linear time-varying difference equations into left polynomial fractions consisting of polynomials in z with variable coefficients

  • Note that the coefficients of the power series in Equation (7) are written on the right. This leads to left polynomial fractions for the transform in the case when x (n) satisfies a linear time-varying difference equation

Read more

Summary

Introduction

Zadeh system function, which first appeared in [1]. In that work, linear time-varying systems/filters are studied in terms of the time-varying z-transform. It is this property along with the left-shift property that converts signals or two-variable time functions given by linear time-varying difference equations into left polynomial fractions consisting of polynomials in z with variable coefficients Given a VIT transform that is a polynomial fraction in z−1 , the scaling of z−i by a time function results in a large collection of new transforms which are polynomial fractions This construct results in the generation of a class of signals that satisfy linear time-varying recursions.

The VIT Transform
Properties of the VIT Transform
Combining and Decomposing Polynomial Fractions
Extended Euclidean Algorithm
Sum of Two Polynomial Fractions
Fraction Decomposition
The VIT Transfer Function Representation
Concluding Comments
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call