A Fast Recursive Two Dimensional Cosine Transform
Chingwo Ma · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1989
This paper presents a recursive, radix two by two, fast algorithm for computing the two dimensional discrete cosine transform (2D-DCT). The algorithm allows the generation of the next higher order 2D-DCT from four identical lower order 2D-DCT's with the structure being similar to the two dimensional fast Fourier transform (2D-FFT). As a result, the method for implementing this recursive 2D-DCT requires fewer multipliers and adders than other 2D-DCT algorithms.