Efficient computation of near-field diffraction patterns by means of   subsampled convolution [also Erratum 33(4)1368(Apr1994)]

Dan Owen Harris

doi:10.1117/12.149147

1 January 1994 Efficient computation of near-field diffraction patterns by means of subsampled convolution [also Erratum 33(4)1368(Apr1994)]

Dan Owen Harris

Author Affiliations +

Optical Engineering, Vol. 33, Issue 1, (January 1994). https://doi.org/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.

Citation Download Citation

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). https://doi.org/10.1117/12.149147

Published: 1 January 1994

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available