Abstract
Merging the twiddle factors in two neighbouring stages for the frequency-decimal FFT algorithm, we can obtain the twiddle factor merged frequency-decimal FFT algorithm. The result is exactly the same as that of the Recursive Cyclotomic Factorization Algorithm (RCFA) derived by Martens (1984) by use of the theory of polynomial algebra. So it has the advantages of simple sturcture and high efficiency in computation. It is much easier to be understood and implemented by engineers than RCFA, and it is also easy to be generalized to the case of time-decimal FFT.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.B. Martens,IEEE Trans. on ASSP,ASSP-32 (1984), 750.
A. V. Oppenheim, R. W. Schafer, Digital Signal Processing, Prentice-Hall Inc., 1975.
Author information
Authors and Affiliations
About this article
Cite this article
Wei, X., Zongzhi, C. Twiddle factor merged frequency-decimal FFT algorithm—A new explanation of the RCFA. J. of Electron.(China) 5, 81–86 (1988). https://doi.org/10.1007/BF02778812
Issue Date:
DOI: https://doi.org/10.1007/BF02778812