Gradient-probability-driven discrete search algorithm for on-chip photonics inverse design
Author(s): Yang, SL (Yang, Shanglin); Jia, H (Jia, Hao); Zhang, L (Zhang, Lei); Dai, JC (Dai, Jincheng); Fu, X (Fu, Xin); Zhou, T (Zhou, Ting); Zhang, GL (Zhang, Gaolu); Yang, L (Yang, Lin)
Source: OPTICS EXPRESS Volume: 29 Issue: 18 Pages: 28751-28766 DOI: 10.1364/OE.432313 Published: AUG 30 2021
Abstract: The inverse-designed photonic device, with the characteristics of high performance and ultra-high compactness, is suitable for on-chip photonics applications. The gradient-based algorithms have high convergence efficiency. However, they depend on the continuous independent variable, so they cannot be directly applied to the pixel-based discrete search methods. In this paper, we propose a gradient-probability-driven discrete search (GPDS) algorithm for photonics inverse design. The algorithm establishes a connection between the gradient and the discrete value set by introducing the method of probability sampling. As an intrinsic discrete search algorithm in which the values of pixels are selected from a finite number of the discrete set, no additional discretization process is needed. Compared with the traditional brute-force search (BFS) method and traditional gradient method, the probability sampling process of our proposed GPDS algorithm can improve device performance efficiently and provide better stability to the initial states. We illustrate several component designs which are commonly used in the silicon photonics platform, and the results show that the algorithm can achieve high-performance structures within fewer iterations and has the ability of multi-objective optimization. With good flexibility and manufacturing-friendly geometry control, the algorithms are potential to be a powerful tool in solving multi-objective problems. (C) 2021 Optical Society of America under the terms of the OSA Open Access Publishing Agreement
Accession Number: WOS:000691863500061
ISSN: 1094-4087
Full Text: https://www.osapublishing.org/oe/fulltext.cfm?uri=oe-29-18-28751&id=458058