Related Experiment Video
Updated: Feb 21, 2026

Studying Murine Small Bowel Mechanosensing of Luminal Particulates
Published on: March 18, 2022
M2NuFFT-A computationally efficient suboptimal power spectrum estimator for fast exploration of nonuniformly sampled
Jie Cui1, Benjamin H Brinkmann1, Gregory A Worrell1
1Department of Neurology and Department of Physiology and Biomedical Engineering, Mayo Clinic, Rochester, 55902, MN, USA.
Abstract:
Nonuniformly sampled signals are prevalent in real-world applications. However, estimating their power spectra from finite samples poses a significant challenge. The optimal solution-Generalized Prolate Spheroidal Sequence (GPSS) by solving the associated Generalized Eigenvalue Problem (GEP)-is computationally intensive and thus impractical for large datasets. This paper describes a fast, nonparametric method: Multiband-Multitaper Nonuniform Fast Fourier Transform (M2NuFFT), which substantially reduces computational burden while maintaining statistical efficiency. The algorithm partitions the signal frequency band into multiple sub-bands. Within each sub-band, optimal tapers are computed at a nominal analysis band and shifted to other analysis bands using the Nonuniform Fast Fourier Transform (NuFFT), avoiding repeated GEP computations. Spectral power within the analysis band is then estimated as the average power across the taper outputs. For the special case where the nominal band is centered at zero frequency, tapers can be approximated via cubic spline interpolation of Discrete Prolate Spheroidal Sequence (DPSS), eliminating GEP computation entirely. This reduces the complexity from to as low as . Statistical properties of the estimator, assessed using Bronez GPSS theory, reveal that the bias and variance bound of the M2NuFFT estimator are identical to those of the optimal estimator. Additionally, the degradation of bias bound indicates deviation from optimality. Finally, we propose an extension of Thomson -test to test periodicity in nonuniform samples. The estimator's performance is validated through simulation and real-world data, demonstrating its practical applicability. The Matlab code of the fast algorithm is available on GitHub [1].
Related Concept Videos
Sampling Theorem
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Upsampling
Sampling Continuous Time Signal
In the...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...

