2020
DOI: 10.1109/jphot.2020.2966918
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Optical Spatial First-Order Differentiator Based on Graphene-Based Metalines and Evolutionary Algorithms

Abstract: We propose a novel optical spatial differentiator to perform the differentiation computation in terahertz region based on the graphene metalines, which consist of graphene layers with different widths and chemical potentials. The numerical simulation results show that when beam waist size w>1.9λ, the metalines perform the first-order differentiation in the reflection spectrum with efficiency>97%, which can be theoretically demonstrated by using transfer matrix method. In order to further improve the performanc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 41 publications
(58 reference statements)
0
1
0
Order By: Relevance
“…Genetic algorithm (GA) and particle swarm optimization (PSO) are two representative evolution algorithms, which are inspired by the genetic inheritance and group cooperation. 47,48 Although GA and PSO have been widely applied in the optimization and design of photonic devices, [49][50][51][52][53][54][55][56] they are easy to converge too early and fall into local optimal solution in sometimes. Moreover, simulated annealing (SA) and direct-binary search (DBS) are traditional search algorithms which require less time to converge.…”
Section: Introductionmentioning
confidence: 99%
“…Genetic algorithm (GA) and particle swarm optimization (PSO) are two representative evolution algorithms, which are inspired by the genetic inheritance and group cooperation. 47,48 Although GA and PSO have been widely applied in the optimization and design of photonic devices, [49][50][51][52][53][54][55][56] they are easy to converge too early and fall into local optimal solution in sometimes. Moreover, simulated annealing (SA) and direct-binary search (DBS) are traditional search algorithms which require less time to converge.…”
Section: Introductionmentioning
confidence: 99%