Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform

3 January 1991

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 27 (1) , 82-84
https://doi.org/10.1049/el:19910053

Abstract

A new fast algorithm is presented for computing the two-dimensional discrete cosine transform (2D DCT) using the fast discrete Radon transform. The algorithm has the lowest number of multiplications compared with other algorithms. Furthermore, the algorithm is well suited for parallel implementation.

Keywords

FAST ALGORITHM
TWO-DIMENSIONAL DISCRETE COSINE TRANSFORMS
FAST DISCRETE RADON TRANSFORM
PARALLEL IMPLEMENTATION

This publication has 0 references indexed in Scilit: