K-means cluster algorithm applied for geometric shaping based on iterative polar modulation in inter-data centers optical interconnection

Xia Sheng, Qi Zhang*, Ran Gao, Dong Guo*, Zexuan Jing, Xiangjun Xin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The demand of delivering various services is driving inter-data centers optical interconnection towards 400 G/800 G, which calls for increasing capacity and spectrum efficiency. The aim of this study is to effectively increase capacity while also improving nonlinear noise anti-interference. Hence, this paper presents a state-of-the-art scheme that applies the K-means cluster algorithm in geometric shaping based on iterative polar modulation (IPM). A coherent optical communication simulation system was established to demonstrate the performance of our proposal. The investigation reveals that the gap between IPM and Shannon limit has significantly narrowed in terms of mutual information. Moreover, when compared with IPM and QAM using the blind phase searching under the same order at HD-FEC threshold, the IPM-16 using the K-means algorithm achieves 0.9 dB and 1.7 dB gain; the IPM-64 achieves 0.3 dB and 1.1 dB gain, and the IPM-256 achieves 0.4 dB and 0.8 dB gain. The robustness of nonlinear noise and high capacity enable this state-of-the-art scheme to be used as an optional modulation format not only for inter-data centers optical interconnection but also for any high speed, long distance optical fiber communication system.

Original languageEnglish
Article number2417
JournalElectronics (Switzerland)
Volume10
Issue number19
DOIs
Publication statusPublished - 1 Oct 2021

Keywords

  • Inter-data centers optical interconnection
  • Iterative polar modulation
  • K-means cluster algorithm

Fingerprint

Dive into the research topics of 'K-means cluster algorithm applied for geometric shaping based on iterative polar modulation in inter-data centers optical interconnection'. Together they form a unique fingerprint.

Cite this