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

摘要

A new fast N×M two-dimensional (2-D) type IV discrete cosinentransform (2-D DCT-IV) algorithm is proposed by jointly using thenone-dimensional (1-D) polynomial transform (1-D PT) and the N length-Mn1-D DCTs. Compared to the known row-column method, the proposednalgorithm requires less than one-half of number of multiplications and ansmaller number of additions