Abstract

A fully automated approach for designing metasurfaces whose unit cell may include metallic vias is proposed. Towards this aim, a ternary version of the particle swarm optimization (PSO) algorithm is employed in order to find the optimal metallic pattern and via-hole positions simultaneously. In the proposed design method, the upper surface of the unit cell is first pixelated. One of the possible three states of a metallic covered pixel, an uncovered etched pixel and a pixel containing a centered metalized via-hole is assigned to each pixel. The optimal state of each pixel is then determined by utilizing a ternary PSO algorithm to achieve favorable design goals. This method can be used for designing various metasurfaces as well as other via-assisted electromagnetic structures. As a proof of concept, the proposed method was applied to design two surfaces: a frequency selective surface with a minimum resonance frequency, and a linear-to-circular polarization converter with a maximum polarization conversion bandwidth. Comparison of the results with previous works confirms the efficiency and capability of the proposed method to design diverse metasurfaces in an automated fashion without the need for any theoretical or physical model.

Details

Title
Ternary optimization for designing metasurfaces
Author
Hojjati Azin 1 ; Soleimani Mohammad 1 ; Nayyeri Vahid 2 ; Ramahi, Omar M 3 

 Iran University of Science and Technology, School of Electrical Engineering, Tehran, Iran (GRID:grid.411748.f) (ISNI:0000 0001 0387 0587) 
 Iran University of Science and Technology, School of Advanced Technologies, Tehran, Iran (GRID:grid.411748.f) (ISNI:0000 0001 0387 0587) 
 University of Waterloo, Department of Electrical and Computer Engineering, Waterloo, Canada (GRID:grid.46078.3d) (ISNI:0000 0000 8644 1405) 
Publication year
2021
Publication date
2021
Publisher
Nature Publishing Group
e-ISSN
20452322
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2563936487
Copyright
© The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.