| 一种面向MIMD并行机实现的FFT并行算法 |
| |
| 引用本文： | 林水生,黄顺吉. 一种面向MIMD并行机实现的FFT并行算法[J]. 电子科技大学学报(社会科学版), 1997, 0(6) |
| |
| 作者姓名： | 林水生 黄顺吉 |
| |
| 作者单位： | 电子科技大学电子工程系 |
| |
| 摘 要： | 提出了一种适合于多指令流多数据流并行机和计算机网络并行实现的快速傅里叶变换的系数矩阵块对角化并行算法。该并行算法的并行度高，且各个并行任务在运算期间不需要互相通信，因而在计算机网络及通信速率和带宽较低的并行计算机上并行实现时效率较高。
|
| 关 键 词： | 并行算法；快速傅里叶变换；多指令流多数据流并行机；计算机网络 |
Fast Algorithm of DFT with Only A Subset of Input or Output Points Using GFFT |
| |
| Sun Shixin Zheng Wenxue. Fast Algorithm of DFT with Only A Subset of Input or Output Points Using GFFT[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 1997, 0(6) |
| |
| Authors: | Sun Shixin Zheng Wenxue |
| |
| Abstract: | Most of FFT algorithms are designed for the general situation in which the length of input and output sequences are equal.In special situations,it should be studied carefully for practical applications.This paper provides a new algorithm using GFFT which is more efficient than pruning method,transform decomposition and so on. |
| |
| Keywords: | discrete fourier transform fast fourier transform generalized fourier transform fast computation |
| 本文献已被 CNKI 等数据库收录！ |
