Presentation + Paper
15 November 2019 Study on the performances of dwell time algorithms in ion beam figuring
Author Affiliations +
Proceedings Volume 11175, Optifab 2019; 111750M (2019) https://doi.org/10.1117/12.2536869
Event: SPIE Optifab, 2019, Rochester, New York, United States
Abstract
Dwell time calculation is one of the most important process in a highly deterministic computer-controlled Ion Beam Figuring (IBF) process. It is modeled as a deconvolution process between the desired removal map and the beam removal function, which is an ill-posed inverse problem. A good dwell time solution should fulfill four requirements: 1) it must be non-negative; 2) it should closely duplicate the shape of the desired removal map; 3) the total dwell time is expected to be as short as possible; 4) the calculation time is reasonable. Dwell time algorithms, such as Fourier transform-based algorithm, matrix-based algorithm, and Bayesian-based algorithm, have been proposed and applied to IBF. However, their performances were never clearly examined and described accordingly. In this research, we provide a quantitative study on the performances of these dwell time algorithms based on the aforementioned four requirements.
Conference Presentation
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tianyi Wang, Lei Huang, Kashmira Tayabaly, and Mourad Idir "Study on the performances of dwell time algorithms in ion beam figuring", Proc. SPIE 11175, Optifab 2019, 111750M (15 November 2019); https://doi.org/10.1117/12.2536869
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Ion beam finishing

Ion beams

Deconvolution

Fourier transforms

Metrology

Convolution

Synchrotrons

Back to Top