Parallel computation of GS algorithm and its robustness to rounding-off error and noise
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.
Downloads
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.
