This paper proposes a hybrid architecture

algorithm for fast computation of DCT and DFT via

recursive factorization. Recursive factorization of DCT-II

and DFT transform matrix leads to a similar architectural

structure so that common architectural base may be used by

simply adding a switching device. Linking between two

transforms was derived based on matrix recursion

formula. Also computational complexity is comparable to

those of the fast DCT algorithms for moderate size of N.