Real-valued fast Fourier transform algorithms
暂无分享,去创建一个
Douglas L. Jones | C. Sidney Burrus | Henrik V. Sorensen | Michael T. Heideman | H. V. Sorensen | C. Burrus | M. Heideman
[1] C. Sidney Burrus,et al. Prime factor FFT algorithms for real-valued series , 1984, ICASSP.
[2] B. Lee. A new algorithm to compute the discrete cosine Transform , 1984 .
[3] T. Parks,et al. A prime factor FFT algorithm using high-speed convolution , 1977 .
[4] Lawrence R. Rabiner. On the use of symmetry in FFT computation , 1979 .
[5] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.
[6] S. Prakash,et al. A new radix-6 FFT algorithm , 1981 .
[7] Peter D. Welch,et al. The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms☆ , 1970 .
[8] Pierre Duhamel,et al. Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data , 1986, IEEE Trans. Acoust. Speech Signal Process..
[9] R. Kumaresan,et al. A prime factor FFT algorithm with real valued arithmetic , 1985, Proceedings of the IEEE.
[10] H. Ziegler. A fast Fourier transform algorithm for symmetric real-valued series , 1972 .
[11] R. Preuss,et al. Very fast computation of the radix-2 discrete Fourier transform , 1982 .
[12] M. Vetterli,et al. Simple FFT and DCT algorithms with reduced number of operations , 1984 .
[13] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.
[14] R.C. Agarwal,et al. Number theory in digital signal processing , 1980, Proceedings of the IEEE.
[15] Ken'iti Kido,et al. A new FFT algorithm of radix 3, 6, and 12 , 1986, IEEE Trans. Acoust. Speech Signal Process..
[16] J. Martens. Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform , 1984 .
[17] T. Parsons. A winograd-Fourier transform algorithm for real-valued data , 1979 .
[18] Douglas L. Jones,et al. On computing the discrete Hartley transform , 1985, IEEE Trans. Acoust. Speech Signal Process..
[19] Jean-Bernard Martens,et al. Discrete Fourier transform algorithms for real valued sequences , 1984 .
[20] R. Yavne,et al. An economical method for calculating the discrete Fourier transform , 1899, AFIPS Fall Joint Computing Conference.
[21] C. Burrus,et al. An in-place, in-order prime factor FFT algorithm , 1981 .
[22] C. Burrus. Index mappings for multidimensional formulation of the DFT and convolution , 1977 .
[23] Alan R. Jones,et al. Fast Fourier Transform , 1970, SIGP.
[24] E. Dubois,et al. A new algorithm for the radix-3 FFT , 1978 .
[25] Martin Vetterli,et al. Cyclic convolution of real sequences: Hartley versus Fourier and new schemes , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[26] C. Sidney Burrus,et al. On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..
[27] D BerglandGlenn. Numerical Analysis: A fast fourier transform algorithm for real-valued series , 1968 .
[28] Ronald N. Bracewell. The Hartley transform , 1986 .
[29] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .
[30] G. Bergland,et al. A radix-eight fast Fourier transform subroutine for real-valued series , 1969 .
[31] P. Duhamel,et al. `Split radix' FFT algorithm , 1984 .
[32] Richard C. Singleton,et al. On computing the fast Fourier transform , 1967, Commun. ACM.
[33] C. K. Yuen,et al. Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.