REVIEW 2 cited by
DBSCAN for nonlinear equalization in high-capacity multi-carrier optical communications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Coherent optical multi-carrier communications have recently dominated metro-regional and long-haul optical communications. However, the major obstacle of networks involving coherent multi-carrier signals such as coherent optical orthogonal frequency-division multiplexing (CO-OFDM) is the fiber-induced nonlinearity and the parametric noise amplification from cascaded optical amplifiers which results in significant nonlinear distortion among subcarriers. Here, we present the first nonlinear equalizer in optical communications using the traditional Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm and a novel modified version of DBSCAN which combines K-means clustering on the noisy un-clustered symbols. For a 24.72 Gbit/sec differential quaternary phase-shift keying (DQPSK) CO-OFDM system, the modified DBSCAN can increase the signal quality-factor by up to 2.158 dB compared to linear equalization at 500 km of transmission. The modified DBSCAN slightly outperforms the traditional DBSCAN, fuzzy-logic C-means, hierarchical and conventional K-means clustering at high launched optical powers.
Forward citations
Cited by 2 Pith papers
-
A Survey on Machine and Deep Learning for Optical Communications
A survey that catalogs ML and DL algorithms for optical fiber, network, and wireless systems, with quantitative tables of reported gains and comparisons to conventional methods.
-
A Survey on Machine Learning for Optical Communication [Machine Learning View]
A survey of machine learning for optical communication that classifies many references by algorithm type, but contains factual inaccuracies and an unsupported first-time claim.
Discussion (0). Continue with ORCID to comment.