A new approach for computing the discrete Fourier transform of arbitrary length

A new approach for computing DFT of arbitrary length is proposed, which is based on the arithmetic Fourier transform (AFT). The algorithm needs only /spl Oscr/(N) multiplications and has a simple computational structure, so it can be easily performed in parallel and it is very suitable for VLSI design. The algorithm is faster than the classical FFT when the length of the DFT contains relatively large factors. It is especially efficient for computing the DFT of prime length, where FFT does not work. The algorithm is competitive with the FFT in term of accuracy. A method to enhance the accuracy of the algorithm is also proposed for cases when higher accuracy is required.