By Topic

Efficient computation of spherical harmonic transform using parallel architecture of CUDA

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Weiyu Huang ; Research School of Engineering, College of Engineering and Computer Science, The Australian National University, Canberra, Australia ; Zubair Khalid ; Rodney A. Kennedy

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.

Published in:

Signal Processing and Communication Systems (ICSPCS), 2011 5th International Conference on

Date of Conference:

12-14 Dec. 2011