Let x(n) (n = 0, 1, …, N−1) be a real input sequence. We assume that N = 2t, where t > 0. The scaled DCT of x(n) is defined as follows:
Let CN be the transform matrix of the DCT, that is
To derive the fast algorithm, we first get a factorization of the transform matrix based on the following lemma ...