Fast algorithms for the discrete cosine transform

1992/01/01 by Ephraim Feig, S. Winograd · 5 citations
Computer Science · Mathematics · #Digital Filter Design and Implementation #Image and Signal Denoising Methods #Advanced Data Compression Techniques #Discrete cosine transform #Algorithm #Quantization (signal processing) #Data compression #Transform coding #Computer science #Modified discrete cosine transform #Signal processing #Trigonometric functions #Signal compression #Discrete sine transform #Discrete Hartley transform #Mathematics #Image processing #Digital signal processing #Artificial intelligence #Image (mathematics) #Fourier transform #Fourier analysis #Fractional Fourier transform

paper · doi:10.1109/78.157218

openalex publication_date 1992/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

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.>

Citations

• On computing the discrete Fourier transform
• Discrete Cosine Transform
• On the multiplicative complexity of the Discrete Fourier Transform

Cited by

• A fast algorithm for computing multidimensional dct on certain small sizes
• Fast and numerically stable algorithms for discrete cosine transforms
• Fast Algorithm for the 3-D DCT-II
• Low-complexity 8-point DCT approximations based on integer functions
• Discrete cosine transform [wikipedia]