作者: D. Kolba , T. Parks
DOI: 10.1109/TASSP.1977.1162973
关键词:
摘要: Two recently developed ideas, the conversion of a discrete Fourier transform (DFT) to convolution and implementation short convolutions with minimum multiplications, are combined give efficient algorithms for long transforms. Three compared in terms number multiplications additions. Timing prime factor fast (FFT) algorithm using high-speed convolution, which was programmed an IBM 370 8080 microprocessor, is presented.