Scaled DCT's on input sizes that are composite
Ephraim Feig, E. Linter · IEEE Transactions on Signal Processing · 1995
Given efficient scaled discrete cosine transforms (DCT's) of size p and q, where p and q are relatively prime, we present methods for constructing fast algorithms to compute scaled DCT's and scaled inverse DCT's of size pq. Extensions to multidimensional transforms are also given.>