Matrix decomposition representation of fast DCT algorithms

This paper describes the matrix decomposition of two popular 1D DCT algorithms. In this form, the link and differences in the computational structure between the two algorithms are revealed and the vector-radix algorithms based on Lee's (1984) and Hou's (1987) 1D fast algorithms for multidimensional DCTs are readily formulated using the properties of the Kronecker product.