pith. sign in

arxiv: 1407.2415 · v1 · pith:HGOA54XAnew · submitted 2014-07-09 · 💻 cs.IT · cs.SY· eess.SY· math.IT· math.OC

FIR Digital Filter Design by Sampled-Data H-infinity Discretization

classification 💻 cs.IT cs.SYeess.SYmath.ITmath.OC
keywords designdigitalfilterh-infinitymethodanalogoptimizationprocessing
0
0 comments X
read the original abstract

FIR (finite impulse response) digital filter design is a fundamental problem in signal processing. In particular, FIR approximation of analog filters (or systems) is ubiquitous not only in signal processing but also in digital implementation of controllers. In this article, we propose a new design method of an FIR digital filter that optimally approximates a given analog filter in the sense of minimizing the H-infinity norm of the sampled-data error system. By using the lifting technique and the KYP (Kalman-Yakubovich-Popov) lemma, we reduce the H-infinity optimization to a convex optimization described by an LMI (linear matrix inequality). We also extend the method to multi-rate and multi-delay systems. A design example is shown to illustrate the effectiveness of the proposed method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.