A Fast Computational Algorithm for the Discrete Cosine Transform
Wen-Hsiung Chen, Cassady Smith, S. Fralick · IRE Transactions on Communications Systems · 1977
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.