1 January 1994 Efficient computation of near-field diffraction patterns by means of subsampled convolution [also Erratum 33(4)1368(Apr1994)]
Author Affiliations +
Optical Engineering, 33(1), (1994). doi:10.1117/12.149147
Abstract
We introduce subsampled convolution and convolution with an aggregate kernel as computationally efficient techniques for discrete convolution of the free-space propagation kernel with generalized and rectangular aperture functions, respectively, in computing near-field diffraction patterns. We develop fast Fourier transform based algorithms for implementing subsampled and aggregate kernel convolution, then demonstrate the memory and execution time economy of these techniques through computational examples.
Dan Owen Harris, "Efficient computation of near-field diffraction patterns by means of subsampled convolution [also Erratum 33(4)1368(Apr1994)]," Optical Engineering 33(1), (1 January 1994). http://dx.doi.org/10.1117/12.149147
JOURNAL ARTICLE
5 PAGES


SHARE
KEYWORDS
Convolution

Diffraction

Near field diffraction

Algorithm development

Fourier transforms

Sodium

Light wave propagation

Back to Top