Related Experiment Video
Updated: Jul 19, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
Double-lens extended fractional Fourier transform
1Institute of Information Optics, Zhejiang Normal University, Jinhua, China.
Applied Optics
|October 28, 2006
Summary
A novel double-lens system enables arbitrary-order extended fractional Fourier transforms (EFRTs), including complex orders. Optical experiments confirm its equivalence to single-lens systems, offering a new basic optical configuration with advantages.
Area of Science:
- Optics and Photonics
- Fourier Optics
- Wave Phenomena
Background:
- The fractional Fourier transform (FRT) is a powerful tool in optical signal processing.
- Extended fractional Fourier transforms (EFRTs) generalize FRT to arbitrary orders.
- Existing single-lens systems for EFRT have limitations in flexibility and order control.
Purpose of the Study:
- To propose and validate a double-lens optical system for performing extended fractional Fourier transforms (EFRTs).
- To demonstrate the capability of the double-lens system to execute arbitrary-order EFRTs, including complex orders.
- To compare the performance and characteristics of the double-lens EFRT with the single-lens EFRT.
Main Methods:
- Development of a double-lens optical configuration for EFRT.
- Theoretical analysis of the double-lens system for real and complex orders.
- Numerical simulations to verify the system's functionality.
- Optical experiments to validate the simulation results and system performance.
Main Results:
- The proposed double-lens system successfully performs arbitrary-order EFRTs.
- Numerical simulations and optical experiments confirm the equivalence between single-lens and double-lens EFRT systems.
- The double-lens EFRT system demonstrates consistency with the single-lens EFRT for both real and complex orders.
- The double-lens setup is established as a viable basic optical configuration.
Conclusions:
- The double-lens EFRT system provides a flexible and effective method for implementing arbitrary-order fractional Fourier transforms.
- The double-lens configuration offers advantages over single-lens systems, enhancing its utility in optical applications.
- This work establishes a new fundamental optical setup for advanced Fourier optics manipulations.
Related Concept Videos
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Discrete-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...
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...
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]...
For a discrete-time periodic signal x[n]...
Continuous -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...
Properties of DTFT II
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...

