Computation of Discrete Fourier Transforms by Polynomial Transforms
暂无分享,去创建一个
[1] C. Rader,et al. A new principle for fast Fourier transformation , 1976 .
[2] M. Bellanger,et al. Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series , 1976, Proceedings of the IEEE.
[3] Henri J. Nussbaumer,et al. Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms , 1978, IBM J. Res. Dev..
[4] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.
[5] D.F.T. computation by fast polynomial transform algorithms , 1979 .
[6] Henri J. Nussbaumer,et al. New polynomial transform algorithms for fast DFT computation , 1979, ICASSP.
[7] J. Cooley,et al. New algorithms for digital convolution , 1977 .
[8] I. J. Good,et al. The Relationship Between Two Fast Fourier Transforms , 1971, IEEE Transactions on Computers.
[9] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .
[10] H. Nussbaumer,et al. Fast computation of discrete Fourier transforms using polynomial transforms , 1979 .