A Kind of Recursion Algorithm of Butterfly FFT and Its Amplications
Weihong Ding · 2002
In this paper a recursion equation of butterfly FFT is represented according to which a program is given. In order to improve this algorithm efficiency author puts forward a new method of polynomial, by which one point (or no more points) can be express as combination of sample data and some periodicity factors.