29.03.2016 Views

Nonlinear Fiber Optics - 4 ed. Agrawal

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

42 Chapter 2. Pulse Propagation in <strong>Fiber</strong>s<br />

where ˆD is a differential operator that accounts for dispersion and losses within a linear<br />

m<strong>ed</strong>ium and ˆN is a nonlinear operator that governs the effect of fiber nonlinearities on<br />

pulse propagation. These operators are given by<br />

ˆD = − iβ 2<br />

2<br />

ˆN = iγ<br />

∂ 2<br />

∂T 2 + β 3<br />

6<br />

(<br />

|A| 2 + i<br />

ω 0<br />

1<br />

∂ 3<br />

∂T 3 − α 2 , (2.4.2)<br />

∂<br />

∂|A| 2 )<br />

A ∂T (|A|2 A) − T R . (2.4.3)<br />

∂T<br />

In general, dispersion and nonlinearity act together along the length of the fiber. The<br />

split-step Fourier method obtains an approximate solution by assuming that in propagating<br />

the optical field over a small distance h, the dispersive and nonlinear effects<br />

can be assum<strong>ed</strong> to act independently. More specifically, propagation from z to z + h<br />

is carri<strong>ed</strong> out in two steps. In the first step, the nonlinearity acts alone, and ˆD = 0<br />

in Eq. (2.4.1). In the second step, dispersion acts alone, and ˆN = 0 in Eq. (2.4.1).<br />

Mathematically,<br />

A(z + h,T ) ≈ exp(h ˆD)exp(h ˆN)A(z,T ). (2.4.4)<br />

The exponential operator exp(h ˆD) can be evaluat<strong>ed</strong> in the Fourier domain using the<br />

prescription<br />

exp(h ˆD)B(z,T )=FT −1 exp[h ˆD(−iω)]F T B(z,T ), (2.4.5)<br />

where F T denotes the Fourier-transform operation, ˆD(−iω) is obtain<strong>ed</strong> from Eq. (2.4.2)<br />

by replacing the operator ∂/∂T by −iω, and ω is the frequency in the Fourier domain.<br />

As ˆD(iω) is just a number in the Fourier space, the evaluation of Eq. (2.4.5) is straightforward.<br />

The use of the FFT algorithm [73] makes numerical evaluation of Eq. (2.4.5)<br />

relatively fast. It is for this reason that the split-step Fourier method can be faster by<br />

up to two orders of magnitude compar<strong>ed</strong> with most finite-difference schemes [52].<br />

To estimate the accuracy of the split-step Fourier method, we note that a formally<br />

exact solution of Eq. (2.4.1) is given by<br />

A(z + h,T )=exp[h( ˆD + ˆN)]A(z,T ), (2.4.6)<br />

if ˆN is assum<strong>ed</strong> to be z independent. At this point, it is useful to recall the Baker–<br />

Hausdorff formula [74] for two noncommuting operators â and ˆb,<br />

(<br />

exp(â)exp(ˆb)=exp â + ˆb + 1 2 [â, ˆb]+ 1<br />

)<br />

12 [â − ˆb,[â, ˆb]] + ··· , (2.4.7)<br />

where [â, ˆb]=âˆb − ˆbâ. A comparison of Eqs. (2.4.4) and (2.4.6) shows that the splitstep<br />

Fourier method ignores the noncommutating nature of the operators ˆD and ˆN. By<br />

using Eq. (2.4.7) with â = h ˆD and ˆb = h ˆN, the dominant error term is found to result<br />

from the commutator 1 2 h2 [ ˆD, ˆN]. Thus, the split-step Fourier method is accurate to<br />

second order in the step size h.<br />

The accuracy of the split-step Fourier method can be improv<strong>ed</strong> by adopting a different<br />

proc<strong>ed</strong>ure to propagate the optical pulse over one segment from z to z + h. In<br />

this proc<strong>ed</strong>ure Eq. (2.4.4) is replac<strong>ed</strong> by<br />

) ( ∫ h z+h<br />

)exp( )<br />

A(z + h,T ) ≈ exp(<br />

2 ˆD<br />

h<br />

exp ˆN(z ′ )dz ′ 2 ˆD A(z,T ). (2.4.8)<br />

z

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!