---
title: Empirical Fourier Decomposition (EFD)
url: https://www.emergentmind.com/topics/empirical-fourier-decomposition-efd
type: topic
---

# Empirical Fourier Decomposition (EFD)

Empirical Fourier Decomposition (EFD) is an adaptive, data-driven signal decomposition technique that leverages Fourier spectrum segmentation combined with ideal zero-phase filtering to yield accurate, consistent modal separation of real-valued, potentially nonlinear and nonstationary signals. EFD is distinct from classical Fourier analysis, Empirical Wavelet Transform (EWT), and Empirical Mode Decomposition (EMD) in its use of spectral-lobe-driven band selection and its avoidance of transition bands and mode mixture. The method has direct applications in fields such as mechanical vibration analysis, biomedical signal processing, and time-frequency analysis, and demonstrates both computational efficiency and robustness, especially with signals containing closely spaced modes [2009.08047, 1912.00414].

## 1. Mathematical Fundamentals and Formulation

EFD decomposes a real, finite-energy signal $x(t)$ into $K$ narrow-band, physically interpretable “modes”: 
$$
x(t) = \sum_{k=1}^K m_k(t)
$$
Each $m_k(t)$ is obtained so that its frequency-domain support, $\hat m_k(\omega)$, is restricted to a small interval of $|\omega|$, corresponding to a dominant spectral lobe. 

### Improved Spectrum Segmentation

- The one-sided spectrum $|\hat x(\omega)|$ on $[0, \pi]$ is constructed.
- The number of desired modes $K$ is set a priori.
- The largest spectral peaks ($\omega=0$, $\omega=\pi$, and local maxima) are sorted by magnitude, and the top $N=K$ are selected: $0 < \Omega_1 < \dots < \Omega_N < \pi$, with endpoints defined as $\Omega_0=0$ and $\Omega_{N+1}=\pi$.
- For each segment $[\Omega_n, \Omega_{n+1}]$, a boundary $\omega_n$ is chosen at the local minimum of $|\hat x(\omega)|$ within that interval:
  $$
  \omega_n = 
  \begin{cases}
      \arg\min_{\omega \in [\Omega_n, \Omega_{n+1}]} |\hat x(\omega)| & \text{if } \Omega_n \neq \Omega_{n+1}\\
      \Omega_n & \text{otherwise}
  \end{cases}
  $$
  [2009.08047, Eq. (26); 1912.00414, Algorithm 2.1]

This boundary selection rule assigns one dominant spectral lobe per segment and minimizes the inclusion of noise-related artifacts.

### Ideal Zero-Phase Filter Bank

For each segment, a rectangular (ideal) band-pass filter is defined:
$$
H_k(\omega) = 
\begin{cases}
    1, & \omega_{k-1} \leq |\omega| \leq \omega_k \\
    0, & \text{otherwise}
\end{cases}
$$
Each mode $m_k(t)$ is reconstructed in the time domain by applying the filter bank in the frequency domain, then inverting via IFFT:
$$
m_k(t) = \text{IFFT}(H_k(\omega)\, \hat x(\omega))
$$
This zero-phase filtering completely suppresses transition bands and eliminates adjacent-mode mixing [2009.08047, Sec. 3.2, Fig. 4].

## 2. Algorithmic Structure and Computational Aspects

The EFD algorithm executes the following core procedure:

1. Compute the FFT of $x(t)$: $X = \text{FFT}(x)$.
2. Perform spectral segmentation based on the sorted magnitudes and local minima to identify $K$ dominant bands.
3. Construct ideal bandpass filters for each segment.
4. For each $k=1, ..., K$:
   - Mask the spectrum: $X_k = H_k \cdot X$.
   - Obtain the $k$th mode: $m_k = \text{IFFT}(X_k)$.
5. The sum of all $m_k$ reconstructs $x(t)$ exactly in the noise-free case.

The pseudocode (from [2009.08047, 1912.00414]) ensures all operations are dominated by $K+1$ FFT/IFFT calls, leading to a practical complexity of $O(R\log R)$ for input of length $R$ and moderate $K$.

| Step        | Operation                      | Complexity        |
|-------------|-------------------------------|-------------------|
| 1           | FFT                           | $O(R\log R)$      |
| 2           | Segmentation (peaks/minima)   | $O(R)$            |
| 3–5         | $K$ masks + IFFTs             | $O(KR\log R)$     |

## 3. Modal Reconstruction, Time-Frequency Representation, and Accuracy

For each mode, analytic representation via the Hilbert transform allows extraction of instantaneous amplitude, phase, and frequency. The time-frequency representation (TFR) is constructed as:
$$
z_k(t) = m_k(t) + j\,\mathcal H\{m_k(t)\}
$$
$$
a_k(t) = |z_k(t)|,\quad \phi_k(t) = \arg(z_k(t)),\quad \omega_k(t) = \frac{d}{dt} \phi_k(t)
$$
A TFR plot visualizes $(t, \omega_k(t), a_k(t))$ per mode, facilitating modal identification even in nonstationary or closely spaced conditions [2009.08047; 1912.00414, Sec. 5].

Quantitative accuracy metrics include mode-wise RMSE, TFR RMSE, and a consistency measure $Q(a, \lambda_r)$. Across a suite of synthetic and real signals, EFD achieves either the lowest or second-lowest RMSE relative to EMD, EWT, and VMD, with particular advantages in situations involving closely spaced or nonstationary modes (see [2009.08047], Tables 2–6 and Figs. 14–15). For instance, in decomposing Sig3 and Sig4, EFD's RMSE is $1.12\times 10^{-2}$ and $9.85\times 10^{-3}$, outperforming EWT and FDM variants.

## 4. Comparative Advantages and Limitations

**Advantages:**
- **Accurate mode separation:** EFD consistently yields high-accuracy decompositions even for nonstationary signals and signals with closely spaced spectral components [2009.08047, 1912.00414].
- **No mode mixing:** Zero-phase, non-overlapping filters eliminate the interband leakage present in EWT and EMD.
- **Deterministic and consistent:** Outcomes are free from the low-to-high/high-to-low ambiguity observed in the original FDM/LTH and FDM/HTL scans.
- **Computational efficiency:** EFD dominates EWT, FDM, VMD, and EMD in runtime, achieving $\sim$0.016 s (versus VMD/EMD $\sim$0.1–1.4 s) for benchmark signals [2009.08047, Table 6; 1912.00414].

**Limitations:**
- **Prescribed mode count:** The number of modes $K$ must be defined or robustly estimated; overestimation may introduce near-zero energy modes, and underestimation causes missed modal content.
- **Gibbs artifacts:** Discrete ideal filtering introduces Gibbs oscillations at segment boundaries; mild windowing or tapering can reduce this, at the cost of slightly fuzzier separation.
- **Low SNR:** Peak and minimum detection in segmentation may become unreliable at very low SNR, thereby necessitating noise-robust variants or threshold optimization.

## 5. Experimental Evaluation and Applications

Numerical experiments using synthetic nonstationary, multimode, and closely spaced signals, as well as real biosignals (e.g., ECG), confirm EFD's consistent separation accuracy and its superior TFR fidelity [2009.08047, 1912.00414]. Notable application domains include:

- **Mechanical systems:** Modal analysis, vibration diagnostics (e.g., gear or shaft monitoring).
- **Biomedical engineering:** Component separation in ECG and EEG recordings, extraction of physiological oscillations.
- **Acoustics and seismology:** Signal discrimination in noisy, multimodal waveforms.
- **Speech and music:** Harmonic/pitch detection, time-varying formant analysis.

In a direct benchmark, EFD outperforms FDM and EWT in extracting underlying heartbeat features in real ECG, providing more compact and physiologically meaningful TFR visualization [1912.00414].

## 6. Relationships to FDM, EWT, and Future Directions

EFD refines the Fourier Decomposition Method (FDM) [1503.06675] by resolving its ambiguity splitting (between low-to-high and high-to-low scans) and tempering FDM's oversensitivity to noise with a more robust segmentation and mode selection. Compared to EWT, EFD’s use of hard-edged, non-overlapping filters eliminates transition band-induced interference.

Areas for further research include:
- **Adaptive mode number detection:** Algorithmic estimation of $K$ via spectral heuristics or machine learning.
- **Noise-robust peak detection:** Enhanced minima/maxima-finding for segmentation in low-SNR regimes.
- **Extension to multivariate and 2D signals:** The development of multichannel or image-domain EFD is a current research frontier [1912.00414].
- **Windowed and smooth-filter variants:** Investigation of windowing strategies to control Gibbs effects without reintroducing mode mixing.
- **Hybridization with other methods:** Integration with Hilbert or wavelet-based approaches for signals with heavy cross-component overlap.

## 7. Summary Table: EFD vs. Related Methods

| Method    | Mode Mixing | Consistency | Runtime      | End Effects   | Key Limitation          |
|-----------|-------------|-------------|--------------|---------------|------------------------|
| EFD       | None        | Consistent  | Fast         | Minor         | Preset $K$, Gibbs      |
| EWT       | Present     | Consistent  | Moderate     | Mild          | Transition leakage     |
| FDM       | None        | Inconsistent| Slower       | None          | LTH/HTL split, noise   |
| EMD/VMD   | Yes         | Moderate    | Slowest      | Strong        | Mode-mixing, cost      |

EFD thus offers a mathematically precise, adaptive, and computationally efficient solution for modal decomposition of complex signals, with mathematical and empirical evidence validating its performance across domains [2009.08047, 1912.00414, 1503.06675].

Source: https://www.emergentmind.com/topics/empirical-fourier-decomposition-efd