| 平行六边形区域上的快速离散傅立叶变换 |
| |
| 引用本文： | 孙家昶,姚继锋. 平行六边形区域上的快速离散傅立叶变换[J]. 计算数学, 2004, 26(3): 351-366 |
| |
| 作者姓名： | 孙家昶 姚继锋 |
| |
| 作者单位： | 中科院软件所并行计算实验室,北京,100080;中科院软件所并行计算实验室,北京,100080 |
| |
| 基金项目： | 国家重点基础研究项目(G19990328)，国家基金委项目(60173021)资助 |
| |
| 摘 要： | 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.
|
| 关 键 词： | FFT DGFT 六边形剖分 |
A FAST ALGORITHM OF DISCRETE GENERALIZED FOURIER TRANSFORMS ON HEXAGON DOMAINS |
| |
| Sun Jiachang Yao Jifeng. A FAST ALGORITHM OF DISCRETE GENERALIZED FOURIER TRANSFORMS ON HEXAGON DOMAINS[J]. Mathematica Numerica Sinica, 2004, 26(3): 351-366 |
| |
| Authors: | Sun Jiachang Yao Jifeng |
| |
| Affiliation: | Sun Jiachang Yao Jifeng (Parallel Computing Division, Institute of Software, Academica Sinica, Beijing, 100080) |
| |
| Abstract: | 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(N2logN). In particulary, for N = 2P23P34P45P56P6, the floating point computation working amount equals to (17/2P-2 + 16p3 + 135/8P4 + 2424/25p5 + 201/2p6)3N2. Numerical examples are given to access our analysis. |
| |
| Keywords: | FFT DGFT on Hexagon Domain FDGFT |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算数学》浏览原始摘要信息 |
|
点击此处可从《计算数学》下载全文 |
