A fast algorithm suitable for DCT implementation with integer multiplication

The discrete cosine transform (DCT) has wide applications in speech and image data compression. We propose a novel fast DCT algorithm. The proposed algorithm is based on the symmetric property of the DCT kernel matrix. This decomposes an N-point DCT into an N/2-point DCT and can be iterated further. Because it has fewer multiplication steps, when converting the algorithm into hardware implementation with integer computation, we can reduce the error.