In this paper, we propose a fast algorithm for computing the DGFT (Discrete Generalized Fourier Transforms) on hexagon domains [6], based on the geometric properties of the domain. Our fast algorithm (FDGFT) reduces t...
详细信息
In this paper, we propose a fast algorithm for computing the DGFT (Discrete Generalized Fourier Transforms) on hexagon domains [6], based on the geometric properties of the domain. Our fast algorithm (FDGFT) reduces the computation complexity of DGFT from O(N4) to O(N2 log N). In particulary, for N =2^P23^P34^P45^P56^P6, the floating point computation working amount equals to(17/2P2 + 16p3 + 135/8p4 + 2424/25p5 + 201/2P6)3N^2. Numerical examples are given to access our analysis.
In this paper, we propose a new set of orthogonal basis functions in the arbitrarytriangular domain. At first, we generalize the 1-D Sturm-Liouville equation tothe arbitrary triangular domain on a barycentric coordina...
详细信息
In this paper, we propose a new set of orthogonal basis functions in the arbitrarytriangular domain. At first, we generalize the 1-D Sturm-Liouville equation tothe arbitrary triangular domain on a barycentric coordinate, and derive a set ofcomplete orthogonal basis functions on this domain. Secondly, we analyze thesymmetry and periodicity property of these functions and classify them into fourclasses. At last, we show some of the visualization results of these basis functions.
暂无评论