A Fast Algorithm Based on Discrete Cosine Transform(DCT)

Traditional fast algorithms for DCT are aimed at sequences with 2 N length and it is math-intensive for sequences which contain odd numbers of elements. This paper analyzes the redundant calculation of cosine transform of non-2 N -point sequences and put forward a fast algorithm for one-dimensional DCT with odd length. Also, according to the separability of two-dimensional DCT, we can generalize the fast algorithm for one-dimensional DCT to two-dimensional DCT to implement and complete the fast algorithm. The simulation suggests that this algorithm improves the speed of calculation.