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

Lecture

Signal Processing Fundamentals

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 covers the fundamentals of signal processing, focusing on discrete time signals, random variables, probability density functions, and spectral factorization. It also delves into the concepts of minimum phase systems, zero-phase systems, and spectral factorization in the context of causal systems and transforms. The instructor explains the correlation, covariance, and stationarity of stochastic processes, emphasizing the power spectral density and the projection theorem in Hilbert spaces. Practical exercises involve generating and analyzing AutoRegressive (AR) processes.

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

Ontological neighbourhood

Statistics

Data analysis: Time series

Statistical inference: Mathematical statistics

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

Stationary process

In mathematics and statistics, a stationary process (or a strict/strictly stationary process or strong/strongly stationary process) is a stochastic process whose unconditional joint probability distribution does not change when shifted in time. Consequently, parameters such as mean and variance also do not change over time. If you draw a line through the middle of a stationary process then it should be flat; it may have 'seasonal' cycles around the trend line, but overall it does not trend up nor down.

Correlation

In statistics, correlation or dependence is any statistical relationship, whether causal or not, between two random variables or bivariate data. Although in the broadest sense, "correlation" may indicate any type of association, in statistics it usually refers to the degree to which a pair of variables are linearly related. Familiar examples of dependent phenomena include the correlation between the height of parents and their offspring, and the correlation between the price of a good and the quantity the consumers are willing to purchase, as it is depicted in the so-called demand curve.

Pearson correlation coefficient

In statistics, the Pearson correlation coefficient (PCC) is a correlation coefficient that measures linear correlation between two sets of data. It is the ratio between the covariance of two variables and the product of their standard deviations; thus, it is essentially a normalized measurement of the covariance, such that the result always has a value between −1 and 1. As with covariance itself, the measure can only reflect a linear correlation of variables, and ignores many other types of relationships or correlations.

Discrete-time Fourier transform

In mathematics, the discrete-time Fourier transform (DTFT), also called the finite Fourier transform, is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function.

Hilbert space

In mathematics, Hilbert spaces (named after David Hilbert) allow the methods of linear algebra and calculus to be generalized from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise naturally and frequently in mathematics and physics, typically as function spaces. Formally, a Hilbert space is a vector space equipped with an inner product that induces a distance function for which the space is a complete metric space.

Related lectures (51)

Time Series: Fundamentals and Models

Explores the fundamentals of time series analysis, including stationarity, linear processes, forecasting, and practical aspects.

Time Series: Linear Filtering and Spectral Estimation

Explores linear filtering, spectral estimation, and second-order stationarity in time series analysis.

Stochastic Processes: Basics & Stationarity

Covers signal generation, statistical relations, stationarity, white noise, and orthogonality in stochastic processes.

Dependence and Correlation

Explores dependence, correlation, and conditional expectations in probability and statistics, highlighting their significance and limitations.

Quantifying Statistical Dependence: Covariance and Correlation