Matrix Factorization for Fast DCT Algorithms
暂无分享,去创建一个
[1] Michael T. Heideman,et al. Computation of an odd-length DCT from a real-valued DFT of the same length , 1992, IEEE Trans. Signal Process..
[2] B. Lee. A new algorithm to compute the discrete cosine Transform , 1984 .
[3] Ephraim Feig,et al. Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..
[4] Zhongde Wang. Reconsideration of "A Fast Computational Algorithm for the Discrete Cosine Transform" , 1983, IEEE Trans. Commun..
[5] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..
[6] PeiZong Lee,et al. Restructured recursive DCT and DST algorithms , 1994, IEEE Trans. Signal Process..
[7] Chi-Wah Kok,et al. Fast algorithm for computing discrete cosine transform , 1997, IEEE Trans. Signal Process..
[8] Henrique S. Malvar,et al. Corrections to "Fast Computation of the Discrete Cosine Transform and the Discrete Hartley Transform" , 1988 .
[9] Zoran Cvetkovic,et al. New fast recursive algorithms for the computation of discrete cosine and sine transforms , 1992, IEEE Trans. Signal Process..
[10] G. Plonka,et al. Fast and numerically stable algorithms for discrete cosine transforms , 2005 .