Abstract
The convolution and related operators of correlation and autocorrelation are essential and powerful mathematical tools in machine learning, signal processing, systems theory, and related areas. In particular, representation and handling of systems with binary encoded input and output signals requires intensive computation of the correlation and autocorrelation functions which are defined on the finite dyadic groups as the underlying algebraic structure. This paper presents methods for computing the dyadic correlation and autocorrelation functions on graphics processing units (GPUs). The proposed algorithms are based on the convolution and the Wiener–Khinchin theorems and implemented using the Open Computing Language (OpenCL). We address several key issues in developing an efficient mapping of the computations to the GPU architecture. The experimental results confirm that the application of the proposed method leads to significant computational speedups over traditional C/C++ implementations processed on central processing units (CPUs).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Reasoning-based Intelligent Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.