Related Experiment Video
Updated: Jan 27, 2026
06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
279
Modulation format identification assisted by sparse-fast-Fourier-transform for hitless flexible coherent
Optics Express
|March 17, 2019
Summary
This study introduces a fast and accurate modulation format identification (MFI) technique for optical networks, even at low optical signal-to-noise ratios (OSNR). The method enables rapid format switching, crucial for next-generation agile networks.
Area of Science:
- Optical Communications
- Digital Signal Processing
- Signal Analysis
Background:
- Efficient modulation format identification (MFI) is critical for next-generation agile optical networks.
- Current MFI schemes face challenges in low optical signal-to-noise ratio (OSNR) regimes.
Purpose of the Study:
- To propose a blind and fast MFI scheme with high accuracy under low OSNR conditions.
- To enable efficient digital signal processing (DSP) in receiver-side (Rx) modules.
Main Methods:
- Signal power is raised to the 4th power, and peak-to-average power ratio (PAPR) is calculated to differentiate 32QAM from QPSK, 16QAM, and 64QAM.
- Iterative partitioning based on signal amplitude removes QPSK-like phases, followed by PAPR calculation for remaining formats.
- Frequency offset (FO) pre-compensation and sparse-fast-Fourier-transform (S-FFT) reduce computational complexity.
Main Results:
- High identification accuracy achieved even below the forward error correction (FEC) threshold (BER=2×10⁻²).
- Numerical and experimental validation using 28 Gbaud DP coherent systems up to 1500 km SSMF.
- Demonstrated fast format switching between 64QAM-32QAM (B2B) and 32QAM-16QAM (900 km SSMF).
Conclusions:
- The proposed MFI scheme offers robust performance in challenging low OSNR environments.
- Enables fast and accurate modulation format identification for flexible optical networks.
- Facilitates seamless format switching, enhancing network agility and performance.
More Related Videos
09:38Dithranol as a Matrix for Matrix Assisted Laser Desorption/Ionization Imaging on a Fourier Transform Ion Cyclotron Resonance Mass Spectrometer
Published on: November 26, 2013
14.6K
08:59Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps
Published on: October 28, 2018
7.6K
Related Concept Videos
01:10Fast Fourier Transform
932
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...
932
01:21Properties of Fourier Transform I
644
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...
644
01:24Properties of Fourier Transform II
759
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...
759
01:15Discrete Fourier Transform
886
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...
886
01:07Basic signals of Fourier Transform
926
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...
926
01:11Continuous -time Fourier Transform
897
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...
897