2013
DOI: 10.1007/s11081-013-9212-z
|View full text |Cite
|
Sign up to set email alerts
|

Design of code division multiple access filters based on sampled fiber Bragg grating by using global optimization algorithms

Abstract: In this article, we focus on the design of code division multiple access filters (used in data transmission) composed of a particular optical fiber called sampled fiber Bragg grating (SFBG). More precisely, we consider an inverse problem that consists in determining the effective refractive index profile of an SFBG that produces a given reflected spectrum. In order to solve this problem, we use an original multilayers semi-deterministic global optimization method based on the search of suitable initial conditi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 7 publications
(14 citation statements)
references
References 35 publications
0
14
0
Order By: Relevance
“…This algorithm, called Hybrid GA Multi-layer line search Algorithm (HGMA), has been reported and validated on various industrial problems in 11,14,15,16,17 .…”
Section: Hybrid Ga Secant Methodsmentioning
confidence: 99%
“…This algorithm, called Hybrid GA Multi-layer line search Algorithm (HGMA), has been reported and validated on various industrial problems in 11,14,15,16,17 .…”
Section: Hybrid Ga Secant Methodsmentioning
confidence: 99%
“…The stopping criteria is based on a target minimum value for the functional to be reached within given maximum number of iterations. Global optimization is necessary since we have no information on the convexity of the cost function and several local minima may be present.We apply a multi-criteria global optimization algorithm (Ivorra et al, 2013) which aims at improving the initial condition for classical gradient-based methods (Mohammadi & Pironneau, 2009).…”
Section: Global Optimizationmentioning
confidence: 99%
“…In this work, we set this maximum value to 50,000 for each performance because, according to the literature [12,13,16,17], it is a high enough value. If such an algorithm consumes all the 50,000 evaluations and its solution does not satisfy the first stopping criterion (7), we consider that the algorithm has failed solving numerically the problem at hand.…”
Section: Validation Of the Gmamentioning
confidence: 99%
“…Initialization is also of vital importance for meta-heuristic methods such as Genetics Algorithms (GA) [7,8], for which a lack of heterogeneity in the individuals of the initial population may yield to a early convergence to a local minimum of T [9]. From a general point of view, choosing suitable initial conditions can improve the efficiency of existing optimization algorithms by reducing the number of evaluations of the cost function, which is particularly worthy when dealing with expensive functional calculations, as it is the case in many industrial design problems [10][11][12][13][14][15][16][17][18]. There already exists several optimization algorithms which have been improved by choosing appropriate initialization techniques.…”
Section: Introductionmentioning
confidence: 99%