It is well-known that IIR filters can have a much lower order than FIR filters with the same performance. On the downside is that the implementation of an IIR filter is an iterative procedure while that of an FIR filter is a one-shot computation. But in higher dimensions IIR filters are definitely more attractive. We offer a technique where the filter’s performance specifications, stability constraints, its convergence speed and a protection against possible adverse effects of perturbations are all included in the design from the start. The technique only needs an off-the-shelf LP solver because the filter is obtained as a Chebyshev center of a convex polytope. The method deals with general non-causal non-separable filters.
Multidimensional digital filtersNon-causalIIRLinear programmingQuadratic programmingRational approximation