Fast algorithms for the discrete W transform and for the discrete Fourier transform
暂无分享,去创建一个
[1] N. Ahmed,et al. Discrete Cosine Transform , 1996 .
[2] A. Jain,et al. A Fast Karhunen-Loeve Transform for a Class of Random Processes , 1976, IEEE Trans. Commun..
[3] T. Parks,et al. A prime factor FFT algorithm using high-speed convolution , 1977 .
[4] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..
[5] R. Agarwal. Comments on "A prime factor FFT algorithm using high-speed convolution" , 1978 .
[6] H. Kekre,et al. Comparative performance of various trigonometric unitary transforms for transform image coding , 1978 .
[7] Anil K. Jain,et al. A Sinusoidal Family of Unitary Transforms , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] K. R. Rao,et al. A Fast Computational Algorithm for the Discrete Sine Transform , 1980, IEEE Trans. Commun..
[9] Zhong-De Wang. Harmonic analysis with a real function of frequency — II. periodic and bounded cases , 1981 .
[10] Zhongde Wang. Harmonic analysis with a real frequency function. III. Data sequence , 1981 .
[11] Zhong-De Wang. Harmonic analysis with a real frequency function—I. aperiodic case , 1981 .
[12] Zhong-De Wang. A fast algorithm for the discrete sine transform implemented by the fast cosine transform , 1982 .
[13] R. Preuss,et al. Very fast computation of the radix-2 discrete Fourier transform , 1982 .
[14] Bobby R. Hunt,et al. The discrete cosine transform-A new version , 1983, ICASSP.
[15] Zhongde Wang. Reconsideration of "A Fast Computational Algorithm for the Discrete Cosine Transform" , 1983, IEEE Trans. Commun..