Fast Computational for the Discrete Cosine Transform

In a previous paper El, the authors have shown t h a t it is possible t o map a n odd length type I1 and type I11 even DCT (EDCT) t o a real-valued DFT of the same length with sign changes and permutations only.In this paper, we shall extend the approach t o devise efficient algorithms f o r computing the odd discrete cosine and sine transforms (ODCT and ODST) . I t i s found t h a t a N point type I ODCT can be reformulated as a (2N-l)-point DFT of a real-symmetric sequence. Also, by representing the odd indices in the type 11, 111 and IV transforms using the Ruritanian map, it is possible t o construct a simple index mapping which maps the transforms t o a type I ODCT or ODST of the same length with permutations and sign changes only.Similar results are obtained f o r t h e odd sine transforms.Using the Kronecker matrix product representation of the multidimensional transforms, all these algorithms can be generalized t o higher dimensions.

show abstract

A fast recursive algorithm for computing the discrete cosine transform

Hou

1987

IEEE Trans. Acoust., Speech, Signal Process.

294

View full text Add to dashboard Cite

Fast Computational for the Discrete Cosine Transform

Cited by 3 publications

References 26 publications

A new two-dimensional fast cosine transform algorithm

A new two-dimensional fast cosine transform algorithm

Fast odd sinusoidal transform algorithms

A fast recursive algorithm for computing the discrete cosine transform

Contact Info

Product

Resources

About