A fast pipelined DFT processor and its programming consideration

Abstract
A new discrete Fourier transform (DFT) processor with a pipelined structure has been developed. This processor is designed to optimise computation of the pair of operationsAx0 ±Bx1, which is mostly encountered in various fast DFT algorithms. For real-valued data and coefficients, the processor needs only two machine cycles to calculate the pair of operations. A straightforward multiple-stage transform algorithm has been proposed to implement real-valued prime-factor or radix-type transforms. About half of the computation can be saved by taking into account the fact that transform outputs are conjugate pairs for real inputs. The short Winograd Fourier transform algorithm is suggested as a basic building block for large transforms because it is more efficient than the fast Fourier transform.

This publication has 0 references indexed in Scilit: