Parallel computation of GS algorithm and its robustness to rounding-off error and noise

  • Joshua Jesli Dublado Santiago National Institute of Physics, University of the Philippines Diliman
  • Giovanni Alarkon Tapang National Institute of Physics, University of the Philippines Diliman
  • Caesar Aya-ay Saloma National Institute of Physics, University of the Philippines Diliman

Abstract

We use a graphics processing unit (GPU) to speed up the calculation of the  Fourier transform in the Gerchberg Saxton (GS) algorithm, angular spectrum method and the correlation integral. The use of the cuFFT GPU implementation of the Fourier transformation process decreases significantly the average runtime of the aforementioned methods which are useful tools in information and signal processing. We examine the robustness of GS algorithm against the presence of rounding-off errors and noise in the target image and found that reconstruction fidelity deteriorates nonlinearly with decrease in the bit number representation or signal-to-noise ratio of the target image.

Published
2018-05-28
How to Cite
[1]
J. J. Santiago, G. Tapang, and C. Saloma. Parallel computation of GS algorithm and its robustness to rounding-off error and noise, Proceedings of the Samahang Pisika ng Pilipinas 36, SPP-2018-2C-05 (2018). URL: https://paperview.spp-online.org/proceedings/article/view/SPP-2018-2C-05.
Section
Computational Physics and Simulations