Chapter 4
Linear Filters
When building a model to describe the behavior of some of the most commonly used systems, we often rely on the superposition principle. It amounts to assuming linearity (the use of Kirchoff’s laws are an example). Usually, time invariance is also assumed. It consists of saying that, on the time scales that are used, the characteristics of these systems remain unchanged.
Linear filters are defined in the following by these two properties. Because of their importance in the field of signal processing, the next two chapters deal exclusively with filters. This chapter presents the main properties, as well as a few design methods.
4.1 Definitions and properties
Definition 4.1 (Linear filter) A discrete-time linear filter1 is a system whose output sequence results from the input sequence {x(n)} according to the expression:
![]()
where the sequence {h(n)} that characterizes the filter is called the impulse response. The (x * h) operation is called convolution (Figure 4-1).
For example, the processing defined by y(n) =
x(n) +
x(n – 1) is therefore a linear filtering. The sequence {h(n)} is defined by h(0) = , h(1) = and h(n) = 0 for any value of n ≠ {0, 1}.
For commonly ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access