A New Fast Algorithm for the Discrete Cosine Transform

We prepose a new fast algorithm for computing discrete cosine transform and its inverse on two dimensional input sizes which are powers of 2.Because the integer operation is more faster than the float operation in computer,the integer operation is used in this algorithm.Through the matrix linear transform the number of operation for multiplications and additions is reduced,so that the speed is greatly raised.This algorithm is applied to our developmented JPEG image coding,and yields very good results.

Project Supported:

Clc Number:

TP391.41