Abstract
Starting from an index mapping for one to multi-dimensions, a general in-place and in-order prime factor FFT algorithm is proposed in this paper. In comparing with existing prime factor FFT algorithms, this algorithm saves about half of the required storage capacity and possesses a higher efficiency. In addition, this algorithm can easily implement the DFT and IDFT in a single subroutine.
Similar content being viewed by others
References
J. W. Cooley, J. W. Tukey,Math. Comput. 19(1965), pp. 297–301.
P. C. Singelton,IEEE Trans. on AU,AU-17(1969), pp.99–103.
P. Duhamel H. Hallmann,Elec. Letts. 20(1984), pp.14–16.
C. M. Rader, N. M. Brenner,IEEE Trans. on ASSP,ASSP-24(1976), pp.264–265.
Zhongde Wang,IEEE Trans. on ASSP,ASSP-32(1984), pp.804–816.
S. Winograd,Math. Comput.,32(1978), pp.175–199.
D. P. Kolba, T. W. Parks,IEEE Trans. Acoust. Speech, Signal Process.,ASSP-25(1977), pp. 281–294.
L. R. Morris,IEEE Trans. on ASSP,ASSP-26(1978), 141–150.
C. S. Burrus, P. W. Eschenbacher,IEEE Trans. Acoust. Speech, Signal Process.,ASSP-29(1981), pp.806–817.
I. J. Good,J. Royal Statist. Soc. ser. B,20(1958), pp. 361–372.
I. J. Good,IEEE Trans. Comput.,C-20(1971), pp.310–317.
J. H. Rothweiler,IEEE Trans. Acoust., Speech, signal Process.,ASSP-30(1982), pp. 105–107.
H. W. Johnson, C. S. Burrus,IEEE Trans. Acoust., Speech, signal Process.,ASSP-33(1985), pp. 248–254.
F. Perez, T. Takaoka,IEEE Trans. Acoust., Speech, signal Process.,ASSP-35(1987), pp. 1221–1223.
C. S. Burrus,IEEE Trans. Acoust., Speech, signal Process.,ASSP-25(1977), pp. 239–242.
Zhongde Wang,Elec. Letts,25(1989), pp.781–782.
H. Y. Sorenson,et al. IEEE Trans. on ASSP,ASSP-34 (1986), pp.152–156.
Author information
Authors and Affiliations
Additional information
Supported by the National Natural Science Foundation of China.
About this article
Cite this article
Zhongde, W. A general in-place and in-order prime factor FFT algorithm. J. of Electron.(China) 8, 60–67 (1991). https://doi.org/10.1007/BF02784414
Issue Date:
DOI: https://doi.org/10.1007/BF02784414