Related Experiment Video

Updated: Feb 15, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

481

Doppler-free Fourier transform spectroscopy

Samuel A Meek, Arthur Hipke, Guy Guelachvili

    Optics Letters
    |January 13, 2018
    PubMed

    More Related Videos

    Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy10:03

    Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy

    Published on: June 27, 2014

    18.4K
    Blood Flow Imaging with Ultrafast Doppler05:57

    Blood Flow Imaging with Ultrafast Doppler

    Published on: October 14, 2020

    8.5K

    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...
    988
    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...
    702
    Properties of Fourier Transform II01:24

    Properties of Fourier Transform II

    The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
    The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
    808
    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...
    943
    Basic signals of Fourier Transform01:07

    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...
    1.0K
    Continuous -time Fourier Transform01:11

    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...
    941