Related Experiment Video
Updated: Jun 6, 2026
06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
Incoherent fractional Fourier transform and its optical implementation.
Applied Optics
|November 10, 2010
Summary
A new incoherent fractional Fourier transform is introduced for incoherent light, avoiding speckle effects and simplifying digital processing. This real transform offers potential applications in image and signal processing with reduced complexity.
Area of Science:
- Optics
- Digital Signal Processing
Background:
- Coherent systems for fractional Fourier transforms suffer from speckle effects and require complex incoherent-coherent conversion.
- Existing methods for fractional Fourier transforms are not directly applicable to incoherent light scenarios.
Purpose of the Study:
- To redefine the fractional Fourier transform for application with incoherent light.
- To introduce a real-valued transform that overcomes limitations of coherent systems.
- To explore potential applications in digital image and signal processing.
Main Methods:
- Development of a new mathematical framework for the incoherent fractional Fourier transform.
- Design of an incoherent optical implementation using a shearing interferometer.
- Experimental validation of the proposed transform.
Main Results:
- The incoherent fractional Fourier transform is successfully defined as a real transformation.
- The proposed method effectively overcomes speckle effects and the need for incoherent-coherent conversion.
- Laboratory experiments confirmed the feasibility of the optical implementation and the transform's properties.
Conclusions:
- The incoherent fractional Fourier transform offers a viable alternative for processing incoherent light.
- This new transform presents advantages in reduced computing complexity for digital image and signal processing.
- The shearing interferometer provides a practical approach for optical implementation.
Related Concept Videos
01:10Fast 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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
01:21Properties 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...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
01:11Continuous -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...
01:15Discrete 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...
01:26Discrete-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...
One of the notable...
01:21Convergence of Fourier Series
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...