2020
DOI: 10.1016/j.optcom.2020.126280
|View full text |Cite
|
Sign up to set email alerts
|

A modified PSO assisted blind modulation format identification scheme for elastic optical networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 24 publications
0
8
0
Order By: Relevance
“…e PSO algorithm is a classical population optimization algorithm proposed in 1995, which is fast in iterations and has better global than local optimization seeking ability [20]. e particle swarm position update equation is as follows:…”
Section: Particle Swarm Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…e PSO algorithm is a classical population optimization algorithm proposed in 1995, which is fast in iterations and has better global than local optimization seeking ability [20]. e particle swarm position update equation is as follows:…”
Section: Particle Swarm Algorithmmentioning
confidence: 99%
“…The PSO algorithm is a classical population optimization algorithm proposed in 1995, which is fast in iterations and has better global than local optimization seeking ability [ 20 ]. The particle swarm position update equation is as follows: where w is the weight of V id k , and P p and P g are the individual optimum and group optimum, respectively.…”
Section: Segmentation Of Retinal Vessels Based On Pmssa Multi-thresho...mentioning
confidence: 99%
“…To further evaluate the performance of the proposed MFI scheme, the non-iterative clustering algorithm in [28], the density-peak-based method in [29], the DNN-based method in [? ], the amplitude-distribution-based method in [30] and the modified-PSO-based method in [24] are used to compare the minimum required OSNR and the number of symbols for 100% perfect identification, which is shown in Fig. 13.…”
Section: The Comparison With the Required Symbols And Minimal Osnr Valuementioning
confidence: 99%
“…method [24], principal component analysis and singular value decomposition algorithm [25]. For the review of MFI researches above, compared with the decision-parameter based type and aided information based type, machine learning based algorithms have attracted significant attentions with the advantage of flexible and high-performance.…”
mentioning
confidence: 99%
“…The previously-reported MFI schemes for optical fiber communications were roughly classified into the following three categories: (1) data-aided schemes [9][10][11], in which additional pilot information is introduced and the computational complexity of the MFI scheme is low (at the cost of reduced spectral efficiency); (2) schemes based on Stokes space [7,8,[12][13][14][15][16][17][18][19][20][21][22][23], which are not sensitive to carrier phase noise, frequency offset or polarization mixing; (3) schemes based on signal characteristics arising from constant modulus algorithm (CMA) equalization [24][25][26][27][28][29][30][31][32][33], which are based on CMA-equalized signals and do not require any space mapping. Meanwhile, CMA can also compensate for residual chromatic dispersion (CD) and polarization mode dispersion (PMD).…”
Section: Introductionmentioning
confidence: 99%