Related Experiment Video
Updated: Jun 7, 2026
06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
Fractional Fourier transform: simulations and experimental results
Applied Optics
|November 2, 2010
Summary
This study addresses optical implementation of the fractional Fourier transform. An asymmetrical setup is proposed and validated experimentally to achieve a non-scaled output, differing from previous scaled-output methods.
Area of Science:
- Optics
- Optical signal processing
- Fourier optics
Background:
- Two optical interpretations of the fractional Fourier transform (FT) operator have recently emerged.
- Implementing the fractional FT optically presents practical challenges.
Purpose of the Study:
- To investigate and resolve implementation issues related to the fractional Fourier transform operation.
- To compare different optical configurations for performing the fractional FT.
Main Methods:
- Analysis of the original bulk-optics configuration for fractional FT.
- Development and experimental testing of an asymmetrical optical setup.
- Comparison of experimental results with computer simulations.
Main Results:
- The original bulk-optics configuration inherently produces a scaled output due to a fixed lens.
- The proposed asymmetrical setup successfully yields a non-scaled output.
- Experimental results show good agreement with computer simulations.
Conclusions:
- The asymmetrical setup offers an effective solution for obtaining a non-scaled optical fractional Fourier transform.
- Validated optical implementation methods are crucial for practical applications of the fractional FT.
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:07Basic 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 zero. It...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
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: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...
01:17Trigonometric Fourier series
Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
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...