Fast Fourier transform on hexagons

被引：3
|
作者：
Li, HY [1 ]
Sun, JC [1 ]
机构：
[1] Chinese Acad Sci, Lab Parallel Comp, Inst Software, Beijing 100080, Peoples R China
来源：
CURRENT TRENDS IN HIGH PERFORMANCE COMPUTING AND ITS APPLICATIONS, PROCEEDINGS | 2005年
关键词：
Fast Fourier transforms; algorithms; hexagon; non-tensor-product;
D O I：
10.1007/3-540-27912-1_44
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We propose fast algorithms for computing the discrete Fourier transforms on hexagon. These algorithms are easy to implement, they reduce the computation complexity from O(M-2) to 0 (M log M), where M is the total number of sampling points.
引用
收藏
页码：357 / 362
页数：6
相关论文
共 50 条
12345