A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method | IEEE Conference Publication | IEEE Xplore

A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method


Abstract:

A radix-16 fast Fourier transform (FFT) algorithm suitable for multiply-add instruction is proposed. The proposed radix-16 FFT algorithm requires fewer floating-point ins...Show More

Abstract:

A radix-16 fast Fourier transform (FFT) algorithm suitable for multiply-add instruction is proposed. The proposed radix-16 FFT algorithm requires fewer floating-point instructions than the conventional radix-16 FFT algorithm on processors that have a multiply-add instruction. Moreover, this algorithm has the advantage of fewer loads and stores than either the radix-2, 4 and 8 FFT algorithms or the split-radix FFT algorithm. We use Goedecker's method to obtain an algorithm for computing radix-16 FFT with fewer floating-point instructions than the conventional radix-16 FFT algorithm. The number of floating-point instructions for the proposed radix-16 FFT algorithm is compared with those of conventional power-of-two FFT algorithms on processors with multiply-add instruction.
Date of Conference: 06-09 July 2003
Date Added to IEEE Xplore: 18 August 2003
Print ISBN:0-7803-7965-9
Conference Location: Baltimore, MD, USA

References

References is not available for this document.