Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Optimal Least Square Adaptive Filter: FIR Filter

In course

COM-500: Statistical signal and data processing through applications

Building up on the basic concepts of sampling, filtering and Fourier transforms, we address stochastic modeling, spectral analysis, estimation and prediction, classification, and adaptive filtering, with an application oriented approach and hands-on numeri ...

Description

This lecture focuses on the Optimal Least Square Adaptive Filter, specifically the Finite Impulse Response (FIR) Filter. The instructor explains the computational burden difference between FIR and Infinite Impulse Response (IIR) filters, normal equations, and practical considerations. The lecture delves into the iterative solution of the normal equations, cost function minimization, and reducing computational complexity. Practical examples and real-time implementation challenges are discussed, emphasizing the need to optimize solutions. Various approximations and strategies to reduce computational burden are explored, including iterative solutions, merging adaptation and iteration, and replacing statistics with individual values.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Andrea Ridolfi

I am a professor of Signal Processing and Communication Technologies at Bern University of Applied Sciences. Since 2004 I hold a lecturer position at EPFL, teaching “Mathematical Principles of Signal Processing” (Doctoral School, 2004 – 2011), “Statistical Signal and Data Processing through Applications” (Master Program, (2004 – ongoing), and Signal Processing and Machine Learning for Digital Humanities (Master, 2017 – 2019, co-taught with Mathieu Salzmann). Previously, I have been working as Project Manager and R&D Engineer at EPFL (2011-2014), coordinating the LCAV activities within the NSF – Nanotera project Opensense, and as Project Manager and R&D Engineer with the biomedical signal processing group at CSEM (2006-2011).

Official source

Related concepts (32)

Digital filter

In signal processing, a digital filter is a system that performs mathematical operations on a sampled, discrete-time signal to reduce or enhance certain aspects of that signal. This is in contrast to the other major type of electronic filter, the analog filter, which is typically an electronic circuit operating on continuous-time analog signals. A digital filter system usually consists of an analog-to-digital converter (ADC) to sample the input signal, followed by a microprocessor and some peripheral components such as memory to store data and filter coefficients etc.

Linear filter

Linear filters process time-varying input signals to produce output signals, subject to the constraint of linearity. In most cases these linear filters are also time invariant (or shift invariant) in which case they can be analyzed exactly using LTI ("linear time-invariant") system theory revealing their transfer functions in the frequency domain and their impulse responses in the time domain. Real-time implementations of such linear signal processing filters in the time domain are inevitably causal, an additional constraint on their transfer functions.

Ordinary least squares

In statistics, ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model (with fixed level-one effects of a linear function of a set of explanatory variables) by the principle of least squares: minimizing the sum of the squares of the differences between the observed dependent variable (values of the variable being observed) in the input dataset and the output of the (linear) function of the independent variable.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Related lectures (43)

Splines: Fundamentals and Applications

Explores B-splines, natural cubic splines, and smoothing splines in regression problems and their practical applications.

Newton's method: Hessian and optimization

Explores Newton's method for optimization, emphasizing the role of the Hessian matrix.

The leaky integrator: Denoising and impulse response

Covers the leaky integrator, denoising signals, and its impulse response.

Signal Representations

Covers signal representations using concepts such as Haar wavelets and FIR filters.

Linear Classification: Signal Processing