Scaled DCT's on Input Sizes that Are Composite

Abstract

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. © 1995 IEEE