An Algorithm For Computation Of Large Size FFTs In Computer Generated Holograms By Interlaced Sampling

Harnid Farhoosh; Reiner Eschbach; Yashaiahu Fainman; Sing H Lee

doi:10.1117/12.944156

24 May 1988 An Algorithm For Computation Of Large Size FFTs In Computer Generated Holograms By Interlaced Sampling

Harnid Farhoosh, Reiner Eschbach, Yashaiahu Fainman, Sing H Lee

Proceedings Volume 0884, Computer-Generated Holography II; (1988) https://doi.org/10.1117/12.944156
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States

Abstract

An algorithm is presented for the computation of large size FFTs for computer generated holograms. The algorithm is useful when the recording device has a very large space-bandwidth product, while the computation is under memory restrictions. The number of complex operations required using this algorithm is only slightly increased over the number of operations necessary using the FFT algorithm.

Citation Download Citation

Harnid Farhoosh, Reiner Eschbach, Yashaiahu Fainman, and Sing H Lee "An Algorithm For Computation Of Large Size FFTs In Computer Generated Holograms By Interlaced Sampling", Proc. SPIE 0884, Computer-Generated Holography II, (24 May 1988); https://doi.org/10.1117/12.944156

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