Related Experiment Video
Updated: Feb 5, 2026
07:39
Determination of the Excitation and Coupling Rates Between Light Emitters and Surface Plasmon Polaritons
Published on: July 21, 2018
7.3K
On-chip photonic Fourier transform with surface plasmon polaritons
Shan Shan Kou1,2,3, Guanghui Yuan4, Qian Wang5
1Department of Chemistry and Physics, La Trobe Institute for Molecular Science (LIMS), La Trobe University, Melbourne, VIC 3086, Australia.
Light, Science & Applications
|September 1, 2018
Summary
Researchers demonstrate a novel method for performing Fourier transforms (FTs) using surface plasmon polaritons (SPPs). This approach offers a significant speed increase for optical processing, paving the way for ultrafast on-chip photonic computing.
Area of Science:
- Optics and Photonics
- Materials Science
- Nanotechnology
Background:
- The Fourier transform (FT) is crucial for optical processing, typically performed using bulky lenses.
- Conventional optical FTs are limited by lens thickness and focal length, impacting processing speed.
Purpose of the Study:
- To demonstrate an ultrafast Fourier transform using surface plasmon polaritons (SPPs).
- To develop a planar configuration for optical Fourier transforms with reduced propagation distances.
Main Methods:
- Utilized the wave nature of surface plasmon polaritons (SPPs) in a planar device.
- Implemented the Fourier transform in a configuration with a minimal propagation distance of approximately 10 μm.
- Tested the photonic FT by synthesizing SPP waves and their Fourier components.
Main Results:
- Achieved a four to five orders of magnitude increase in transformation speed compared to conventional methods.
- Demonstrated successful implementation of FT in a compact, planar device.
- Validated the photonic FT by synthesizing complex SPP wave patterns.
Conclusions:
- The developed planar SPP-based FT offers a significant speed enhancement for optical processing.
- This technology enables the development of ultrafast on-chip photonic information processing platforms.
- Potential applications include large-scale optical computing and integrated photonic devices.
Related Concept Videos
01:10Fast Fourier Transform
952
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...
952
01:21Properties of Fourier Transform I
664
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...
664
01:24Properties of Fourier Transform II
782
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...
782
01:15Discrete Fourier Transform
904
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...
904
01:07Basic signals of Fourier Transform
947
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...
947
01:11Continuous -time Fourier Transform
913
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...
913