节点文献
提高一维FFT和大矩阵的二维FFT的速度
To Raise The Speed of One-Dimensional FFT, and Two-Dimensional FFT of Large Matrices
【摘要】 本文分析了影响一维FFT速度的因素;着重介绍了作者提出的新的倒序方法——插入倒序法和按时间抽取的(DIT)倒序输入,顺序输出的基4算法的递推公式。同时,对其它一些提高速度的简单易行的方法也作了分析和验证。 文中还分析了影响大矩阵的二维FFT速度的主要因素;提出了一种使大矩阵的数据在内外存之间的读写遍数减至最小的方法——分列随机存取计算法。
【Abstract】 Abstract-In this paper, the factors which affect the speed of one-dimensional FFT are discussed. A new method called inserting approach for reordering a sequence into reversed order is proposed. A set of recursion formulas for radix-4 decimation in time (DIT) algorithm, with inputs in reversed order and outputs in natural order, are given. At the same time, some simple methods for raising the speed of FFT algorithms are discussed and tested. In this paper, the main factor which affects the speed of two-dimensional FFT of a large matrix is also discussed. A new method, called random access approach by splitting columns of a large matrix, which minimizes the number of read/write passes through the deta of a large matrix between internal memory and file memory of a computer, is proposed.
- 【文献出处】 重庆大学学报(自然科学版) ,Journal of Chongqing University(Natural Science Edition) , 编辑部邮箱 ,1982年02期
- 【被引频次】1
- 【下载频次】107