Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Perturbative numerical modeling of microstructure fibers

Open Access Open Access

Abstract

Modeling of microstructure fibers often involves severe computational bottlenecks, in particular when a design space with many degrees of freedom must be analyzed. Perturbative versions of numerical mode-solvers can substantially reduce the computational burden of problems involving automated optimization or irregularity analysis, where perturbations arise naturally. A basic theory is presented for perturbative multipole and boundary element methods, and the speed and accuracy of the methods are demonstrated. The specific optimization results in an elliptical-hole birefringent fiber design, with substantially higher birefringence than the intuitive unoptimized design.

©2004 Optical Society of America

Full Article  |  PDF Article
More Like This
Antiguiding in microstructured optical fibers

M. Yan and P. Shum
Opt. Express 12(1) 104-116 (2004)

Improved symmetry analysis of many-moded microstructure optical fibers

John M. Fini
J. Opt. Soc. Am. B 21(8) 1431-1436 (2004)

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (7)

Fig. 1.
Fig. 1. For many realistic fibers, irregularity in hole geometry is small, but large enough to seriously impact optical properties such as birefringence. A perturbative approach is then natural.
Fig. 2.
Fig. 2. Standard multipole and boundary-element methods require many large-matrix operations for each geometry, since there are many effective index values in the search. A perturbative approach needs very few large-matrix operations for each perturbed geometry.
Fig. 3.
Fig. 3. Test of perturbative method for random hole irregularities. The fiber has three rings of cladding holes with spacing 2 microns, diameter 1 micron, and index 1. The wavelength was 1630 nm and the substrate index was set to 1.45. The geometric perturbations consisted of independently displacing six holes (σx =σy = .02Λ), and placing the remaining 30 holes to preserve sixfold rotational symmetry. Dashed lines indicate expected error trends (blue and pink), the unperturbed loss value (red), and ideal agreement between standard and perturbative methods (black).
Fig. 4.
Fig. 4. For a birefringent fiber with elliptical holes, four holes of the inner ring were initially misaligned. An automated optimization of birefringence adjusts orientations of these four holes, ultimately aligning them with the orientation of the fixed holes. This is an optimization test with an intuitive optimum design. Modes are calculated at wavelength λ = 1.17Λ.
Fig. 5.
Fig. 5. A consistency check confirms that the estimates of birefringence perturbation agree with non-perturbative results at each step in the optimization.
Fig. 6.
Fig. 6. Birefringence is plotted for two optimizations where all 18 holes are free to rotate. Both initially x-oriented and y-oriented holes arrive at equivalent fiber geometries with a substantial improvement in birefringence. Again λ = 1.17Λ.
Fig. 7.
Fig. 7. Orientation angles for the six inner holes are plotted versus optimization step. All holes are initially oriented to ϕj = 90° and ϕj = 0 for the left and right optimizations respectively. Both optimizations are converging to equivalent geometries, rotated 120 degrees from each other. The optimal perturbations at each step approximately maintain point-reflection symmetry about the origin (from which “hidden” curves can be inferred).

Equations (21)

Equations on this page are rendered with MathJax. Learn more.

M ( n eff , λ ) v = 0 .
M ( n ) = M ( n eff = n ; λ , p )
M ( n ) = M 0 ( n ) + δ M 1 ( n ) + δ 2 M 2 ( n ) +
M 1 ( n ) = M δ M ( n ; λ , p 0 + ε p 1 ) M ( n ; λ , p 0 ε p 1 ) 2 ε .
v = v 0 + δ v 1 + δ 2 v 2 +
n = n 0 + δ n 1 + δ 2 n 2 +
[ M 0 ( n 0 + δ n 1 + ) + M 1 ( n 0 + ) + ] [ v 0 + δ v 1 + ] = 0 ,
δ n 1 = u 0 δ M 1 ( n 0 ) v 0 u 0 M 0 ( n 0 ) v 0
M 0 ( n 0 ) v 0 = 0 .
M 0 ( n 0 ) δ v 1 + [ δ n 1 M 0 ( n 0 ) + δ M 1 ( n 0 ) ] v 0 = 0 ,
u 0 [ δ n 1 M 0 ( n 0 ) + δ M 1 ( n 0 ) ] v 0 = 0 .
M 0 p M 0 ( n 0 ) = I v ̂ 0 v ̂ 0 .
δ v 1 = M 0 p [ δ n 1 M 0 ( n 0 ) + δ M 1 ( n 0 ) ] v 0 .
[ M 0 ( n 0 ) ] [ δ 2 v 2 ] + [ δ n 1 M 0 ( n 0 ) + δ M 1 ( n 0 ) ] [ δ v 1 ] + [ M 2 ] [ v 0 ] = 0
M 2 = ( δ 2 v 2 ) M 0 ( n 0 ) + 1 2 ( δ n 1 ) 2 M 0 ( n 0 ) + δ M 1 ( n 0 ) ( δ n 1 ) + δ 2 M 2 ( n 0 )
v 0 = Bx .
A [ δ n 1 M 0 ( n 0 ) + δ M 1 ( n 0 ) ] Bx = 0 ,
A δ M 1 ( n 0 ) Bx = δ n 1 A M 0 ( n 0 ) Bx ,
[ p n Bi ] j = n slow ϕ j n fast ϕ j .
p m + 1 = p m + [ Δ p ] m .
[ Δ p ] m = δ p n Bi p n Bi .
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.