New fast DCT algorithms for composite sequence lengths

This paper presents fast algorithms for the type-II discrete cosine transform of composite sequence length. In particular, a radix-g algorithm, where q is an odd integer, is derived for uniform or mixed radix decomposition of the discrete cosine transform. Compared to other reported fast algorithms, the proposed one uses a smaller number of operations and provides a wider range of choices of sequence lengths.