Polynomial transform computation of the 2-D DCT
A 2-D DCT (discrete cosine transform) algorithm based on a direct polynomial approach is presented. The resulting algorithm reduces the number of both multiplications and additions compared to previous algorithms. It is shown that, although being mathematically involved, it possesses a clean, butterfly-based structure. Tables comparing the number of operations are provided, as well as flowgraphs.<<ETX>>