Related Experiment Video
Updated: Jan 11, 2026

06:42
Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
9.6K
Programmable photonic processor for discrete fractional Fourier transform with π/8-order resolution
Optics Express
|November 11, 2025
Summary
We developed a programmable processor for the discrete fractional Fourier transform (DFrFT) using reconfigurable photonic circuits. This innovation enables scalable optical signal processing for advanced applications like time-frequency analysis.
Area of Science:
- Photonics
- Optical Signal Processing
- Integrated Optics
Background:
- The fractional Fourier transform (FrFT) is vital for signal processing, but conventional methods lack reconfigurability and integrability.
- Existing implementations using lens systems or fiber arrays are bulky and difficult to adapt.
Purpose of the Study:
- To present a novel programmable discrete fractional Fourier transform (DFrFT) processor.
- To overcome limitations of conventional FrFT implementations by enabling dynamic reconfigurability and integration.
Main Methods:
- Designed a processor using a fixed array of basic transformation units (BTUs) with a dynamically reconfigurable architecture.
- Leveraged DFrFT order additivity to synthesize arbitrary DFrFT matrices.
- Employed inverse design to create four BTUs (π/8, π/4, π/2, π) with high simulated fidelity (>0.995).
Main Results:
- Achieved high fidelity (>0.989) for assembled DFrFT matrices across 16 transformation orders in numerical analysis.
- Experimental results on a silicon photonic platform showed individual BTU fidelity (>0.85) and assembled DFrFT fidelity (>0.8).
- Confirmed modularity, reconfigurability, and robustness through order mapping and fabrication tolerance analysis.
Conclusions:
- The developed processor offers a scalable and programmable platform for integrated optical signal processing.
- This technology is particularly suitable for time-frequency transformations and non-stationary signal analysis in optical computing.
- The system demonstrates significant potential for advancing future optical computing systems.
Related Concept Videos
Time and frequency -Domain Interpretation of PI Control
386
Proportional-Integral (PI) controllers are essential in many control systems to improve stability and performance. They are commonly used in everyday devices like thermostats to enhance system damping and reduce steady-state error. When the zero in the controller's transfer function is optimally placed, the system benefits significantly in terms of stability and accuracy.
Acting as a low-pass filter, the PI controller slows the system's response and extends settling times. This requires...
Acting as a low-pass filter, the PI controller slows the system's response and extends settling times. This requires...
386
Discrete-time Fourier transform
1.0K
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...
1.0K
Discrete Fourier Transform
835
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...
835
Fast Fourier Transform
867
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...
867
Discrete-Time Fourier Series
642
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]...
642
Trigonometric Fourier series
724
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...
724

