Xu Hengying, Yang Lishan, Yu Xinkuo, Zheng Zibo, Bai Chenglin, Sun Weibin, Zhang Xiaoguang
Opt Express. 2020 Jul 6;28(14):20249-20263. doi: 10.1364/OE.395433.
We propose a blind and low-complexity modulation format identification (MFI) scheme for elastic optical networks (EONs). Since the square operation reduces half the number of the clusters in Stokes space, the scheme directly performs principal component analysis (PCA) on Stokes parameters after square operation. This greatly reduces the dimensionality of received signals from 3 × N to 3 × 3. Subsequently, three obtained principal components (PCs) are employed synthetically to identify the modulation formats. The effectiveness is first verified through 28 GBaud polarization division multiplexing (PDM)-BPSK/-QPSK/-8QAM/-16QAM/-32QAM/-64QAM simulation systems. Only using 2048 symbols, the required minimum optical signal-to-noise ratio (OSNR) values to achieve 100% MFI success rate are all equal to or lower than their corresponding 7% forward error correction (FEC) thresholds. Besides that, the scheme also obtains significant tolerances to residual chromatic dispersion (CD) and differential group delay (DGD). Finally, the proposed scheme is further verified by 20 GBaud PDM-QPSK/-16QAM/-32QAM long-haul transmission experiments. The results demonstrate that the scheme exhibits good resilience towards fiber nonlinear impairments. More importantly, compared with other four kinds of MFI schemes, the used symbol number to achieve 100% MFI success rate notably equals to at most 2/5 as that of other schemes, and its time complexity can be reduced to O(N).
我们为弹性光网络(EON)提出了一种盲且低复杂度的调制格式识别(MFI)方案。由于平方运算减少了斯托克斯空间中簇的数量,该方案在平方运算后直接对斯托克斯参数进行主成分分析(PCA)。这极大地将接收信号的维度从3×N降低到3×3。随后,综合利用得到的三个主成分(PC)来识别调制格式。首先通过28 GBaud偏振复用(PDM)-BPSK/-QPSK/-8QAM/-16QAM/-32QAM/-64QAM仿真系统验证了该方案的有效性。仅使用2048个符号,实现100% MFI成功率所需的最小光信噪比(OSNR)值均等于或低于其相应的7%前向纠错(FEC)阈值。除此之外,该方案还对残余色度色散(CD)和差分群延迟(DGD)具有显著的容限。最后,通过20 GBaud PDM-QPSK/-16QAM/-32QAM长距离传输实验进一步验证了所提方案。结果表明,该方案对光纤非线性损伤具有良好的恢复能力。更重要的是,与其他四种MFI方案相比,实现100% MFI成功率所使用的符号数量最多仅为其他方案所用符号数量的2/5,并且其时间复杂度可降低到O(N)。