Abstract
Blind modulation format identification (MFI) is indispensable for correct signal demodulation and optical performance monitoring in future elastic optical networks (EON). Existing MFI schemes based on a clustering algorithm in Stokes space have gained good performance, while only limited types of modulation formats could be correctly identified, and the complexities are relatively high. In this work, we have proposed an MFI scheme with a low computational complexity, which combines an improved particle swarm optimization (I-PSO) clustering algorithm with a 2D Stokes plane. The main idea of I-PSO is to add a new field of view on each particle and limit each particle to only communicate with its neighbor particles, so as to realize the correct judgment of the number of multiple clusters (local extrema) on the density images of the s2-s3 plane. The effectiveness has been verified by 28 GBaud polarization division multiplexing (PDM)-BPSK/PDM-QPSK/PDM-8QAM/PDM-16QAM/PDM-32QAM/PDM-64QAM simulation EON systems and 28 GBaud PDM-QPSK/PDM-8QAM/PDM-16QAM/PDM-32QAM proof-of-concept transmission experiments. The results show that, using this MFI scheme, the minimum optical signal-to-noise ratio (OSNR) values to achieve 100% MFI success rate are all equal to or lower than those of the corresponding 7% forward error correction (FEC) thresholds. At the same time, the MFI scheme also obtains good tolerance to residual chromatic dispersion and differential group delay. Besides that, the proposed scheme achieves 100% MFI success rate within a maximum launch power range of -2∼+6 dBm. More importantly, its computational complexity can be denoted as O(N).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.