Algorithm For Computation Of Large Size Fast Fourier Transforms In Computer-Generated Holograms By Interlaced Sampling

Hamid Farhoosh; Yeshaiahu Fainman; Sing H Lee

doi:10.1117/12.7977011

1 June 1989 Algorithm For Computation Of Large Size Fast Fourier Transforms In Computer-Generated Holograms By Interlaced Sampling

Hamid Farhoosh, Yeshaiahu Fainman, Sing H Lee

Author Affiliations +

Optical Engineering, Vol. 28, Issue 6, 286622 (June 1989). https://doi.org/10.1117/12.7977011

Abstract

An algorithm is presented for the computation of large size fast Fourier transforms (FFTs) for computer-generated holograms. The algorithm is useful when the recording device has a very large space-bandwidth product and the computation is under memory restrictions. The number of complex operations required using this algorithm is slightly larger than the number of operations necessary using the FFT algorithm.

Citation Download Citation

Hamid Farhoosh, Yeshaiahu Fainman, and Sing H Lee "Algorithm For Computation Of Large Size Fast Fourier Transforms In Computer-Generated Holograms By Interlaced Sampling," Optical Engineering 28(6), 286622 (1 June 1989). https://doi.org/10.1117/12.7977011

Published: 1 June 1989

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