论文信息 - On computing the discrete Fourier and cosine transforms - 字舞流文

On computing the discrete Fourier and cosine transforms

An efficient algorithm based on real matrix decomposition is developed for computing a class of sinusoidal transforms, that include the discrete Fourier and cosine transform.

[1] H. Kekre,et al. Comparative performance of various trigonometric unitary transforms for transform image coding , 1978 .

[2] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[3] N. Ahmed,et al. Discrete Cosine Transform , 1996 .

[4] R. Agarwal. Comments on "A prime factor FFT algorithm using high-speed convolution" , 1978 .

[5] Zhongde Wang. Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[6] R. Preuss,et al. Very fast computation of the radix-2 discrete Fourier transform , 1982 .

[7] Zhongde Wang. Reconsideration of "A Fast Computational Algorithm for the Discrete Cosine Transform" , 1983, IEEE Trans. Commun..