Related Experiment Video
Updated: Feb 2, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
369
Techniques for arbitrary sampling in two-dimensional Fourier transforms
Summary
Two methods, matrix triple product (MTP) and chirp z-transform (CZT), efficiently compute optical propagation. These methods rival or surpass the fast Fourier transform (FFT) in speed and sampling flexibility for phase retrieval.
Area of Science:
- Optics and Photonics
- Computational Imaging
- Signal Processing
Background:
- Accurate computation of optical propagation is crucial for imaging and phase retrieval.
- Traditional methods like the padded fast Fourier transform (FFT) have limitations in speed and sampling flexibility.
- Exploring alternative computational approaches is essential for advancing optical techniques.
Purpose of the Study:
- To evaluate the performance of matrix triple product (MTP) and chirp z-transform (CZT) for 2D optical propagation.
- To compare MTP and CZT against the conventional padded 2D FFT.
- To identify optimal computational strategies for phase-retrieval algorithms.
Main Methods:
- Theoretical analysis of MTP and CZT algorithms for optical propagation.
- Empirical benchmarking of MTP, CZT, and padded 2D FFT run times.
- Performance evaluation across various sampling regimes relevant to phase retrieval.
Main Results:
- MTP and CZT demonstrate computational performance comparable to or exceeding the padded 2D FFT.
- Both MTP and CZT offer enhanced flexibility in controlling sampling parameters.
- The chirp z-transform (CZT) shows particular promise as a versatile alternative to the 2D FFT.
Conclusions:
- MTP and CZT are effective and efficient methods for 2D optical propagation computations.
- For phase-retrieval applications, CZT presents a robust and flexible general-purpose alternative to the padded 2D FFT.
- These findings can guide the selection of computational tools for advanced optical imaging and analysis.
Related Concept Videos
Fast Fourier Transform
944
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...
944
Properties of Fourier Transform I
659
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...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
659
Properties of Fourier Transform II
776
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...
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...
776
Discrete Fourier Transform
902
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...
902
Basic signals of Fourier Transform
938
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...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
938
Continuous -time Fourier Transform
906
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...
906

