On computing the two-dimensional (2-D) type IV discrete cosine transform (2-D DCT-IV)

A new fast N/spl times/M two-dimensional (2-D) type IV discrete cosine transform (2-D DCT-IV) algorithm is proposed by jointly using the one-dimensional (1-D) polynomial transform (1-D PT) and the N length-M 1-D DCTs. Compared to the known row-column method, the proposed algorithm requires less than one-half of number of multiplications and a smaller number of additions.