On Fast Algorithm for Computing Even-Length DCT

Details On Fast Algorithm for Computing Even-Length DCT On Fast Algorithm for Computing Even-Length DCT

2010-01-21

arxiv.org/abs/1001.3713v1

Computer Science

Data Structures and Algorithms

Scientific paper

We study recursive algorithm for computing DCT of lengths $N=q 2^m$ ($m,q \in \mathbb{N}$, $q$ is odd) due to C.W.Kok. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when $m \leqslant 2$. We also show that C.W.Kok's factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, and show that for some lengths it achieves lower multiplicative complexity than one of known prime factor-based scaled transforms.

Affiliated with

Also associated with

No associations

Rating

On Fast Algorithm for Computing Even-Length DCT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Fast Algorithm for Computing Even-Length DCT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Fast Algorithm for Computing Even-Length DCT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248686