In this paper, we propose a fast algorithm for computing the Discrete Generalized Fourier Transforms on parallel dodecahedron domains with 3 dimensions and 4 directions. Our fast algorithm (HFFT) reduces the computati...In this paper, we propose a fast algorithm for computing the Discrete Generalized Fourier Transforms on parallel dodecahedron domains with 3 dimensions and 4 directions. Our fast algorithm (HFFT) reduces the computation complexity of DGFT from O(N^6) to O(N^3log N). A parallel implementation is given and it has been run on a Linux Cluster up to 32 CPUs.展开更多
文摘In this paper, we propose a fast algorithm for computing the Discrete Generalized Fourier Transforms on parallel dodecahedron domains with 3 dimensions and 4 directions. Our fast algorithm (HFFT) reduces the computation complexity of DGFT from O(N^6) to O(N^3log N). A parallel implementation is given and it has been run on a Linux Cluster up to 32 CPUs.
