On the fast algorithms of multi-dimensional DCT and DST with input/output in normal orders
Pan Ailing · 2002
Fast algorithms for multidimensional DCT are given. The algorithms is based on the successive order reduction of Tchebycheff polynomial, but with input and output in normal order. It is shown that the algorithms with input/output in normal order have more simple structure and require less time than ones with input/output in Hadamard order, and need fewer arithmetic operations than other multidimensional algorithms. The algorithms for DCT may be generalized to the computation for multidimensional DST. A C language program for computing two-dimensional DCT-IV is given.>