Related Experiment Video
Updated: Jan 30, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
353
Reconfigurable vortex beam generator based on the Fourier transformation principle
Optics Express
|January 18, 2019
Summary
Researchers developed a method to generate optical vortex beams with controlled orbital angular momentum (OAM) on a photonic chip. This technique allows for on-demand manipulation and detection of arbitrary OAM superpositions within integrated photonics.
Area of Science:
- Photonics and Optical Engineering
- Integrated Optics
- Quantum Optics
Background:
- Optical vortex beams carry orbital angular momentum (OAM), enabling advanced applications.
- Precise control over OAM superposition is crucial for optical communication and sensing.
- On-chip generation of OAM states offers miniaturization and integration benefits.
Purpose of the Study:
- To propose and demonstrate a method for generating optical vortex beams with arbitrary OAM superposition on a photonic chip.
- To enable on-demand control of OAM components in integrated photonic devices.
- To provide a feasible platform for manipulating vortex beams and detecting OAM states.
Main Methods:
- Utilizing the Fourier transformation principle to control OAM components via incident light phases.
- Designing and fabricating a photonic chip device incorporating nine Fourier holographic gratings.
- Characterizing the generated optical vortex beam's OAM states and working bandwidth.
Main Results:
- Successfully generated optical vortex beams with controllable OAM states ranging from -2 to +2.
- Achieved an 80 nm working bandwidth for the OAM control.
- Demonstrated the feasibility of on-demand OAM manipulation on a photonic chip.
Conclusions:
- The proposed method offers a practical approach for generating arbitrary OAM superpositions on-chip.
- This technology facilitates advanced manipulation and detection of vortex beams in integrated photonics.
- The developed device serves as a key component for future photonic integrated circuits enabling complex OAM functionalities.
Related Concept Videos
Fast Fourier Transform
941
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...
941
Properties of Fourier Transform I
657
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...
657
Properties of Fourier Transform II
770
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...
770
Discrete Fourier Transform
899
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...
899
Basic signals of Fourier Transform
937
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...
937
Continuous -time Fourier Transform
902
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...
902

