Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Efficient computation of spherical harmonic transform using parallel architecture of CUDA
By: Khalid, Z.; Weiyu Huang; Kennedy, R.A.;
2011 / IEEE / 978-1-4577-1180-0
This item was taken from the IEEE Conference ' Efficient computation of spherical harmonic transform using parallel architecture of CUDA ' Spherical harmonics serve as basis functions on the unit sphere and spherical harmonic transform is required in analysis and processing of signals in the spectral domain. We investigate the possibility of parallel computation of spherical harmonic transform using Compute Unified Device Architecture (CUDA) with no communication between parallel kernels. We identify the parallel components in the widely used spherical harmonic transform method proposed by Driscoll and Healy. We provide the implementation details and compare the computational complexity with the sequential algorithm. For a given bandlimited signal with maximum spherical harmonics degree L, using the O(L) number of parallel processing kernels, we present that the spherical harmonic coefficients can be calculated in O(Llog2L) time as compared to O(L2log2L). For corroboration, we provide the simulation results using CUDA which indicate the reduction in computational complexity
Spherical Harmonic Coefficients
Spherical Harmonic Transform
Maximum Spherical Harmonics Degree
Parallel Processing Kernels
Graphics Processing Unit
Algorithm Design And Analysis
Compute Unified Device Architecture