Abstract

The effects of the distribution and the location of the poles and zeros of recursive (IIR) digital filters are investigated. This paper first investigates the distribution of non-trivial poles and zeros and we demonstrate that we can, for example, design a digital filter that both out-performs an elliptic digital filter and has a lower computational cost. In the second part of the paper, we consider the design of recursive filters having nearly-linear phase in the passband to see how constraining pole radius facilitates achieving lower overall group delay.

Full Text
Paper version not known

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