A Fast Computational Algorithm for the Discrete Cosine Transform

1977/09/01 by Wen-Hsiung Chen, Cassady Smith, S. Fralick · 1,150 citations
Computer Science · Engineering · Mathematics · #Advanced Adaptive Filtering Techniques #Algorithm #Analog and Mixed-Signal Circuit Design #Artificial intelligence #Computational complexity theory #Computer science #Digital Filter Design and Implementation #Discrete Fourier transform (general) #Discrete Hartley transform #Discrete cosine transform #Discrete sine transform #Engineering #Fast Fourier transform #Fourier analysis #Fourier transform #Fractional Fourier transform #Implementation #Mathematics #Modified discrete cosine transform #Signal-flow graph #Sine and cosine transforms #Software #Transform coding #Trigonometric functions

paper · doi:10.1109/tcom.1977.1093941

published in IRE Transactions on Communications Systems 25(9), 1004-1009 (Institute of Electrical and Electronics Engineers)

openalex publication_date 1977/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/02

Abstract

A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.

Citations

• Discrete Cosine Transform

Cited by

• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• Fast and numerically stable algorithms for discrete cosine transforms
• On the Computation of the Discrete Cosine Transform
• Lossless Compression in HEVC with Integer-to-Integer Transforms
• A fast cosine transform in one and two dimensions
• Discrete cosine transform [wikipedia]