A Kind of Fast Recursive Algorithm for the Discrete Cosine Transform with Arbitrary Length
Shen Hong-jun · 2007
A fast recursive algorithm is proposed in this paper for the realization of Discrete Cosine Transforms (DCT) with arbitrary length that jointly using Clenshaw recurrence formula and the sym- metry of DCT.Compared with other existed recursive algorithms and the method of arithmetic Fourier transform for computing DCT,the proposed algorithm holds a lower computation complexity.With regular digital filters structures,the algorithm is also effective for VLSI implementation.