Fast cosine transform based on the successive doubling method

Abstract
An efficient and regular algorithm for computing the fast cosine transform (FCT) using the method of successive doubling is presented. The FCT is obtained by the composition of two elementary transforms. Its high regularity facilitates its implementation in VLSI technology.

This publication has 1 reference indexed in Scilit: