排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
平行六边形区域上的快速离散傅立叶变换 总被引:6,自引:0,他引:6
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. 相似文献
1