Related Experiment Video
Updated: Jun 25, 2026

08:22
BrainBeats as an Open-Source EEGLAB Plugin to Jointly Analyze EEG and Cardiovascular Signals
Published on: April 26, 2024
A novel recursive Fourier transform for nonuniform sampled signals: application to heart rate variability spectrum
Alexander Holland1, Mateo Aboy
1Draeger Medical, Telford, PA, USA. alexander.holland@draeger.com
Medical & Biological Engineering & Computing
|February 28, 2009
Summary
We developed a new Recursive Fourier Transform (RFT) for analyzing non-uniformly sampled data, like heart rate variability. This method offers efficient power spectral density estimation compared to existing techniques.
Area of Science:
- Signal Processing
- Biomedical Engineering
- Time Series Analysis
Background:
- Non-uniform sampling presents challenges in signal analysis, particularly for physiological data like heart rate variability (HRV).
- Traditional methods for power spectral density (PSD) estimation often require uniform sampling or involve computationally intensive algorithms.
Purpose of the Study:
- To introduce a novel Recursive Fourier Transform (RFT) for efficiently calculating discrete Fourier transforms of non-uniformly sampled time series.
- To evaluate the RFT's efficacy for power spectral density (PSD) estimation in heart rate variability (HRV) analysis, comparing it against the Lomb-Scargle Transform (LST).
Main Methods:
- The Recursive Fourier Transform (RFT) iteratively computes discrete Fourier transforms without requiring sample interpolation to uniform time intervals.
- The RFT achieves a computational order of N for N frequencies, offering significant efficiency gains.
- The study involved analyzing quasi-stationary signals with simulated missing heartbeats to assess estimation performance.
Main Results:
- The RFT demonstrated comparable estimation performance to the Lomb-Scargle Transform (LST) for PSD estimation of HRV.
- The RFT exhibited significantly lower computational overhead and complexity compared to the LST.
- The RFT is particularly well-suited for iterative spectrum estimation applications with non-uniform time samples.
Conclusions:
- The Recursive Fourier Transform (RFT) provides an efficient and effective alternative for power spectral density estimation of non-uniformly sampled data, especially in heart rate variability analysis.
- The RFT's computational efficiency makes it a valuable tool for real-time or resource-constrained applications.
- This novel method addresses key limitations of existing techniques for analyzing irregular time series data.
Related Concept Videos
Fast Fourier Transform
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Basic signals of Fourier Transform
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Continuous -time Fourier Transform
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
Discrete-time Fourier transform
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
Sampling Theorem
In signal processing, the analysis of continuous-time signals, denoted as x(t), often involves sampling techniques to convert these signals into discrete-time signals. This process is essential for digital representation and manipulation. A critical component in sampling is the train of impulses, characterized by the sampling interval and the sampling frequency. The relationship between these parameters and the original signal's properties dictates the success of the sampling process.

