Computation of Symmetric Discrete Cosine Transform Using Bakhvalov's Algorithm

摘要

A number of algorithms for recursive computation of the discrete cosine transform (DCT) have been developed recently. This paper presents a new method for computing the discrete cosine transform and its inverse using Bakhvalov's algorithm, a method developed for evaluation of a polynomial at a point. In this paper, we will focus on both the application of the algorithm to the computation of the DCT-I and its complexity. In addition, Bakhvalov's algorithm is compared with Clenshaw's algorithm for the computation of the DCT.