Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Fast Algorithm for Computing Even-Length DCT   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.

27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
2
The categories of this paper are: math
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph