Fast Recursive Algorithm for the Discrete Cosine Transform with Arbitrary Length

[1] Wang Z, Jullien G A, and Miller W C. Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length[J].IEEE Signal Processing Letters.1994, 1(7):101-102 [2] Chau L P and Siu W C. Recursive algorithm for the discrete cosine transform with general lengths [J].Electronics Letters.1994, 30(3):197-198 [3] Aburdene M F, Zheng J, and Kozick R J. Computation of discrete cosine transform using Clenshaws recurrence formula [J].IEEE Signal Processing Letters.1995, 2(8):155-156 [4] Chau L P and Siu W C. Efficient recursive algorithm for the inverse discrete cosine transform [J].IEEE Signal Processing Letters.2000, 7(10):276-277 [5] 张宪超, 李宁, 陈国良. 离散余弦变换的改进的算术傅立叶变换算法[J]. 电子学报, 2000, 28(9): 88-90. Zhang Xian-chao, Li Ning, and Chen Guo-liang. An algorithm for computing DCT using improved arithmetic Fourier transform. Acta Electronica Sinica, 2000, 28(9): 88-90. [6] 曾泳泓. 任意长度离散余弦变换的快速算法[J]. 计算数学, 1993, 15(3): 299-302. [7] Liu J G, Li H F, and Chan F H Y, et al.. Fast discrete cosine transform via computation of moments [J].Journal of VLSI Signal Processing.1998, 19(3):257-268 [8] Yang J F and Fan C P. Recursive implementation of discrete cosine transforms: With selectable fixed coefficient filters [J].IEEE Trans. on Circuits and Systems-II.1999, 46(2):211-216 [9] Press W, Teukolsky S A, and Vetterling W T, et al.. Numerical Recipes in C: The Art of Scientific Computing [M]. Cambridge, UK: Cambridge University Press, 1992: 354-359.