2018 23rd Opto-Electronics and Communications Conference (OECC) 2018
DOI: 10.1109/oecc.2018.8730100
|View full text |Cite
|
Sign up to set email alerts
|

Computational-Complexity Comparison of Artificial Neural Network and Volterra Series Transfer Function for Optical Nonlinearity Compensation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 6 publications
0
9
0
Order By: Relevance
“…From computational aspect, the computation time of an ANN depends on the number of layers and node counts at each layer. For a three‐layered feed‐forward NN, computational complexity is given as the following 53,54 : Oi·j+j·k, …”
Section: Neural Networkmentioning
confidence: 99%
“…From computational aspect, the computation time of an ANN depends on the number of layers and node counts at each layer. For a three‐layered feed‐forward NN, computational complexity is given as the following 53,54 : Oi·j+j·k, …”
Section: Neural Networkmentioning
confidence: 99%
“…The non‐linearity of the optical fibre can be approximately represented using a third‐order VSTF and expressed as right leftthickmathspace.5emy(n)=false∑m1=NNhm1xfalse(nm1false)+false∑m1=NNm2=NNhm1m2x(xm1)x(xm2)+false∑m1=NNm2=m1Nfalse∑m3=NNhm1m2m3xfalse(nm1false)xfalse(nm2false)xfalse(nm3false),thickmathspacewhere x ( n ) and y ( n ) are the input and output of the VSTF at time index n , respectively [1, 2]; hm1, hm1m2 and hm1m2m3 are the first‐, second‐ and third‐order Volterra kernels, respectively; and L = 2 N + 1 expresses the tap length of the VSTF, as shown in Fig. 1 b [6, 7].…”
Section: Ann/vstf and Overestimation Problemmentioning
confidence: 99%
“…With this scheme, ANN‐based digital signal processing is employed in the time domain [3, 4] or the frequency domain [5] to compensate for the optical non‐linearity. We reported the advantages of ANN over VSTF in terms of the computational complexity [6, 7]. Recently, however, the problem of overestimation in an ANN has been reported; specifically, it has been pointed out that an ANN can potentially learn to predict the pseudo‐random binary sequence (PRBS) pattern, resulting in overestimation of the system performance [8, 9].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations