Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Fast Fourier Transform

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Diazepam induced sleep spindle increase correlates with cognitive recovery in a child with epileptic encephalopathy.

BMC neurology·2021

Same author

Noninvasive neuroimaging enhances continuous neural tracking for robotic device control.

Science robotics·2019

Same author

Spectroscopic characterization of manganese minerals.

Spectrochimica acta. Part A, Molecular and biomolecular spectroscopy·2013

Same author

EPR and optical absorption spectral studies on sphalerite mineral.

Spectrochimica acta. Part A, Molecular and biomolecular spectroscopy·2011

Same author

Investigation of Enantiomer Bonding on a Chiral Stationary Phase by FT-Raman Spectrometry.

Analytical chemistry·2011

Same author

Image restoration using multigrid methods.

Applied optics·2010

Same journal

Multifunctional reconfigurable terahertz metasurface based on vanadium dioxide phase transition: achieving broadband absorption and efficient polarization conversion.

Applied optics·2026

Same journal

High-Q-factor electromagnetically induced transparency utilizing quasi-bound states in the continuum in an all-dielectric terahertz metasurface.

Applied optics·2026

Same journal

Automated stitching interferometry for high-precision metrology of X-ray mirrors.

Applied optics·2026

Same journal

Experimental demonstration of an approach to designing a metal-dielectric DBR resonant cavity structure.

Applied optics·2026

Same journal

High-precision wavefront reconstruction from a single-shot interferogram using a physics-driven hybrid feature calibration network.

Applied optics·2026

Same journal

Ultra-high-Q Fano resonance based on coupled topological corner states in Kagome photonic crystals.

Applied optics·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 15, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Fast FFT-based algorithm for phase estimation in speckle imaging.

R L Frost, C K Rushforth, B S Baxter

|March 10, 2010

Summary

This summary is machine-generated.

A new direct algorithm provides fast, accurate least-squares phase estimates from noisy data. This method, utilizing the fast Fourier transform, significantly outperforms iterative techniques for applications like speckle imaging.

More Related Videos

Live Cell Imaging of F-actin Dynamics via Fluorescent Speckle Microscopy (FSM)

Live Cell Imaging of F-actin Dynamics via Fluorescent Speckle Microscopy (FSM)

Published on: August 5, 2009

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

Published on: May 30, 2016

Related Experiment Videos

Last Updated: Jun 15, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Live Cell Imaging of F-actin Dynamics via Fluorescent Speckle Microscopy (FSM)

Live Cell Imaging of F-actin Dynamics via Fluorescent Speckle Microscopy (FSM)

Published on: August 5, 2009

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

Published on: May 30, 2016

Area of Science:

Signal processing
Optical imaging
Computational algorithms

Background:

Phase estimation from noisy sensor arrays is crucial for many imaging applications.
Existing iterative methods for least-squares phase estimation can be computationally intensive and slow.

Purpose of the Study:

To introduce a novel, fast, direct algorithm for accurate least-squares phase estimation.
To improve the efficiency and stability of phase estimation in signal processing.

Main Methods:

Developed a direct algorithm employing the fast Fourier transform (FFT).
The FFT is used to diagonalize and decouple the system of equations derived from the least-squares criterion.
Applied the algorithm to the Knox-Thompson speckle-imaging procedure.

Main Results:

The algorithm achieves accurate and stable least-squares phase estimates.
Demonstrated a speed improvement of approximately one order of magnitude compared to the best iterative methods.
Successfully restored an optical object degraded by simulated atmospheric turbulence.

Conclusions:

The proposed direct algorithm offers a significant advancement in speed and efficiency for phase estimation.
The algorithm's effectiveness is validated through its successful application in speckle imaging for turbulence restoration.