Answers are grounded in this paper and cite their sources.
The primary difficulties of both the time-domain switch decomposition method and the frequency-domain decomposition method are overcome by introducing certain matrix operators and performing spectral factorization of resulting matrices of polynomials in the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">z</tex> -transform variable. Topological operations of the switch-decomposition method are simplified. This new approach eliminates the need to solve a system of equations with rational polynomial coefficients such as arises in the frequency-decomposition method. The determination of a multirate sampled-data system's characteristic polynomial no longer requires the evaluation of a determinant of rational polynomial elements. New results on obtaining modified <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">z</tex> -transforms from standard <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">z</tex> -transforms at a faster rate and vice versa are presented.
No takes yet. Share an insight, caveat, or question.
Boykin et al. (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: