论文部分内容阅读
1975年7月,Samuel Winograd博士发明了一个计算DFT的新算法WFTA,与FFT相比,WFTA的乘法次数要少得多,而加法次数一般并不增加。这种算法不仅在计算速度上,而且在计算精度上都优于FFT。本文介绍这一新算法的原理和计算机程序,此外,还讨论了用微型计算机实现该算法,并与FFT进行了比较。
In July 1975, Dr. Samuel Winograd invented a new algorithm for computing DFT, WFTA. Compared with FFT, WFTA has far fewer multiplications and the number of additions generally does not increase. This algorithm is superior to FFT not only in computational speed but also in computational accuracy. This article describes the principles and computer programs for this new algorithm. In addition, it discusses the use of microcomputers to implement this algorithm and compares it to FFT.