Fast algorithms for the discrete cosine transform

Several fast algorithms for computing discrete cosine transforms (DCTs) and their inverses on multidimensional inputs of sizes which are powers of 2 are introduced. Because the 1-D 8-point DCT and the 2-D 8*8-point DCT are so widely used, they are discussed in detail. Algorithms for computing scaled DCTs and their inverses are also presented. These have applications in compression of continuous tone image data, where the DCT is generally followed by scaling and quantization.<
>