Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Fast Fourier Transform01:10

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...
Discrete-time Fourier transform01:26

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...
Discrete Fourier Transform01:15

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...
Properties of Fourier Transform I01:21

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
Properties of DTFT II01:24

Properties of DTFT II

In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...

You might also read

Related Articles

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

Sort by
Same author

Two-frequency mutual coherence function of a Gaussian beam pulse in weak optical turbulence: an analytic solution.

Applied optics·2010
Same author

Backscattering enhancement by randomly distributed very large particles.

Applied optics·2010
Same author

Diffusion of light in turbid material.

Applied optics·2010
Same author

Comparisons between the small-angle approximation and the numerical solution for radiative transfer theory.

Applied optics·2010
Same author

Transmission, backscattering, and depolarization of waves in randomly distributed spherical particles.

Applied optics·2010
Same author

Backscattering of a picosecond pulse from densely distributed scatterers.

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

Related Experiment Video

Updated: Jun 12, 2026

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
06:37

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

Differential Fourier transform technique for the inverse scattering problem.

K Shimizu, A Ishimaru

    Applied Optics
    |June 23, 2010
    PubMed
    Summary
    This summary is machine-generated.

    A new inversion technique accurately determines the size distribution of tenuous scatterers using forward scattering patterns. This method leverages fast Fourier transforms for efficient analysis of 1-D, 2-D, and 3-D scatterers.

    More Related Videos

    Scattering And Absorption of Light in Planetary Regoliths
    11:34

    Scattering And Absorption of Light in Planetary Regoliths

    Published on: July 1, 2019

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

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

    Published on: May 30, 2016

    Related Experiment Videos

    Last Updated: Jun 12, 2026

    Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
    06:37

    Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

    Published on: June 15, 2022

    Scattering And Absorption of Light in Planetary Regoliths
    11:34

    Scattering And Absorption of Light in Planetary Regoliths

    Published on: July 1, 2019

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

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

    Published on: May 30, 2016

    Area of Science:

    • Physics
    • Optics
    • Materials Science

    Background:

    • Characterizing the size distribution of randomly distributed tenuous scatterers is crucial in various scientific fields.
    • Existing methods often require matrix inversion or prior knowledge of the scatterer size distribution, limiting their applicability.

    Purpose of the Study:

    • To develop a novel inversion technique for determining the size distribution of tenuous scatterers from forward scattering data.
    • To create a method that is versatile, applicable to 1-D, 2-D, and 3-D scatterers, and does not require a priori information.

    Main Methods:

    • The technique utilizes spectral analysis, incorporating fast Fourier transform (FFT) and digital filtering.
    • It processes the forward scattering pattern to retrieve the size distribution without matrix inversion.
    • A 1024-point FFT was employed for analysis, demonstrating robustness against noise.

    Main Results:

    • The developed inversion technique accurately estimates the size distribution of scatterers.
    • Even with 10% noise, the estimation error for a Gaussian size distribution was within a few percent.
    • The method proved effective in practical experiments involving latex spheres and bacteria.

    Conclusions:

    • The novel inversion technique offers an efficient and accurate means to determine scatterer size distributions.
    • Its independence from matrix inversion and prior knowledge makes it a broadly applicable tool.
    • Experimental validation confirms the technique's practical utility in characterizing biological and synthetic scatterers.