| 子群循环法——一种计算一维DFT的新方法 |
| |
| 引用本文： | 郑薇薇,刘永健,沈乃汉,谷稷.子群循环法——一种计算一维DFT的新方法[J].南京邮电大学学报(自然科学版),1987(4). |
| |
| 作者姓名： | 郑薇薇 刘永健 沈乃汉 谷稷 |
| |
| 摘 要： | 本文讨论了一种适合于并行处理的DFT算法——子群循环法,研究了它的序列重排问题以及算法的改进,给出了N为素数及复合数时的一组序列宣排公式,完善了子群循环法,并提出了一种将伪麦森变换与子群循环相结合的混合算法,减少了运算量,适合于在硬件上实现。
|
| 关 键 词： | 离散傅里叶变换 数字信号处理 子群循环法 |
Subgroup Circle Method A New Method for Computing One Dimensional DFT |
| |
| Zheng Weiwei Liu Yongjian Shen Naihan Gu Ji.Subgroup Circle Method A New Method for Computing One Dimensional DFT[J].Journal of Nanjing University of Posts and Telecommunications,1987(4). |
| |
| Authors: | Zheng Weiwei Liu Yongjian Shen Naihan Gu Ji |
| |
| Institution: | Zheng Weiwei Liu Yongjian Shen Naihan Gu Ji |
| |
| Abstract: | In this paper, we discuss a kind of DFT algorithm called the subgroup circle algorithm which suits parallel processing. The problem of rearranging the input and output order is solved and the algorithm is developed. The formulas for rearranging the order when N is prime or not are also presented. So it perfects this algorithm. A hybrid algorithm combining the pseudo Mersennenumber transform and subgroup circle method is given. This hybrid algorithm requires fewer operations and it is more suitable to implement with hardware. |
| |
| Keywords: | Discrete Fourier transform Digital signal processing Subgroup circle method |
| 本文献已被 CNKI 等数据库收录！ |
