1 June 1989 Algorithm For Computation Of Large Size Fast Fourier Transforms In Computer-Generated Holograms By Interlaced Sampling
Author Affiliations +
Optical Engineering, 28(6), 286622 (1989). doi: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.
Hamid Farhoosh, Yeshaiahu Fainman, 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
JOURNAL ARTICLE
7 PAGES


SHARE
RELATED CONTENT


Back to Top