Related Experiment Video

Updated: Jun 26, 2026

Controlled Synthesis and Fluorescence Tracking of Highly Uniform Poly(N-isopropylacrylamide) Microgels
11:34

Controlled Synthesis and Fluorescence Tracking of Highly Uniform Poly(N-isopropylacrylamide) Microgels

Published on: September 8, 2016

Fourier transform light scattering of inhomogeneous and dynamic structures

Huafeng Ding1, Zhuo Wang, Freddy Nguyen

  • 1Quantitative Light Imaging Laboratory, Department of Electrical and Computer Engineering, Beckman Institute for Advanced Science & Technology, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801, USA.

Physical Review Letters
|December 31, 2008
PubMed

More Related Videos

Measurement of Particle Size Distribution in Turbid Solutions by Dynamic Light Scattering Microscopy09:16

Measurement of Particle Size Distribution in Turbid Solutions by Dynamic Light Scattering Microscopy

Published on: January 9, 2017

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

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

Published on: May 30, 2016

Related Concept Videos

Interference and Diffraction02:18

Interference and Diffraction

Interference is a characteristic phenomenon exhibited by waves. When two electromagnetic waves interact with their peaks and troughs coinciding, a resulting wave with enhanced amplitude is produced. This is known as constructive interference. In this case, the two waves interacting are in phase with each other.
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 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...
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 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...
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...