Code: Select all
P R
----- -----
| | | |
| | (z - z_p) | | (z - z_r)
p=1 r=1
----------------- + -----------------
Q S
----- -----
| | | |
| | (z - z_q) | | (z - z_s)
q=1 s=1Code: Select all
P S R Q
----- ----- ----- -----
| | | | | | | |
| | (z - z_p) | | (z - z_s) + | | (z - z_r) | | (z - z_q)
p=1 s=1 r=1 q=1
------------------------------------------------------------------
Q S
----- -----
| | | |
| | (z - z_q) | | (z - z_s)
q=1 s=1from which we can directly see, that the set of poles of the new filter is formed by union of the sets of poles the two original filters because the product of the two products in the new denominator could also be written as a single product running from 1 to Q+S. but how about the zeros? is there some easy way to figure out where the new zeros are? we can write the first summand (consisting of two products) in the numerator as one product (running up to N = P+S) and similarly write the second summand as product running up to M = R+Q, so the denominator becomes:
Code: Select all
N M
----- -----
| | | |
| | (z - z_n) + | | (z - z_m)
n=1 m=1now the question boils down to finding the roots of a sum of two polynomials which are each given in product form (that is, via their roots) - is anyone aware of a formula/theroem how these roots can be obtained from the roots of the two constituting polynomials?
thanks, robin
