Share Email Print

Proceedings Paper

An Algorithm For Computation Of Large Size FFTs In Computer Generated Holograms By Interlaced Sampling
Author(s): Harnid Farhoosh; Reiner Eschbach; Yashaiahu Fainman; Sing H Lee
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 24 May 1988
PDF: 5 pages
Proc. SPIE 0884, Computer-Generated Holography II, (24 May 1988); doi: 10.1117/12.944156
Show Author Affiliations
Harnid Farhoosh, University of California (United States)
Reiner Eschbach, University of California (United States)
Yashaiahu Fainman, University of California (United States)
Sing H Lee, University of California (United States)

Published in SPIE Proceedings Vol. 0884:
Computer-Generated Holography II
Sing H. Lee, Editor(s)

© SPIE. Terms of Use
Back to Top