Related Experiment Video
Updated: Jun 20, 2026

Blood Flow Imaging with Ultrafast Doppler
Published on: October 14, 2020
Speed comparison among methods for restoring signals with missing high-frequency components using two different
Abstract:
An arithmetic operations (multiplications and divisions) count is presented for three recent algorithms that restore signals with missing high-frequency components. The cases when the discrete Fourier-transform (DFT) low-pass-filter matrices had dimensions (a) N by N and (b) N by L were studied, where N is the whole signal length and L is the length of its known part. We show that when N is large all these algorithms are 2 orders of magnitude slower for case (a) than for case (b). We also suggest a method for calculating the rank of the DFT low-pass-filter matrix for case (b) that gives more-accurate results than those previously published.
Related Concept Videos
Reconstruction of Signal using Interpolation
Aliasing
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
Upsampling
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.
Bandpass Sampling
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
Sampling Theorem
