Related Experiment Video
Updated: Aug 23, 2026

Analyzing Neural Activity and Connectivity Using Intracranial EEG Data with SPM Software
Published on: October 30, 2018
Fourier-, Hilbert- and wavelet-based signal analysis: are they really different approaches?
1Neurophysics Group, Physics Department, Philipps University, Renthof 7, D-35032 Marburg, Germany. andreas.a.bruns@daimlerchrysler.com
Abstract:
Spectral signal analysis constitutes one of the most important and most commonly used analytical tools for the evaluation of neurophysiological signals. It is not only the spectral parameters per se (amplitude and phase) which are of interest, but there is also a variety of measures derived from them, including important coupling measures like coherence or phase synchrony. After reviewing some of these measures in order to underline the widespread relevance of spectral analysis, this report compares the three classical spectral analysis approaches: Fourier, Hilbert and wavelet transform. Recently, there seems to be increasing acceptance of the notion that Hilbert- or wavelet-based analyses be in some way superior to Fourier-based analyses. The present article counters such views by demonstrating that the three techniques are in fact formally (i.e. mathematically) equivalent when using the class of wavelets that is typically applied in spectral analyses. Moreover, spectral amplitude serves as an example to show that Fourier, Hilbert and wavelet analysis also yield equivalent results in practical applications to neuronal signals.
Related Concept Videos
Basic signals of Fourier Transform
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Properties of Fourier Transform II
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
Properties of Fourier series II
A function f(t) is...
Discrete Fourier Transform
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Properties of Fourier series I
