Related Experiment Video
Updated: May 30, 2025

11:15
A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors
Published on: May 30, 2016
25.1K
Fourier-optics imaging analysis with ABCD matrices: tutorial
Abstract:
The use of ABCD (ray-transfer) matrices to analyze wave propagation through paraxial optical systems, with emphasis on imaging systems, is described. It is shown how to find the image, Fourier transform, and exit pupil planes. Different forms of the propagation integrals are given. The propagation integral for an imaging system, which includes an aperture stop, is derived. The relationships between the aperture stop and the exit pupil and the impulse response of a paraxial imaging system are derived.
Related Concept Videos
Discrete Fourier Transform
211
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...
211
Fast Fourier Transform
258
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
258
Discrete-Time Fourier Series
213
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]...
For a discrete-time periodic signal x[n]...
213

