On the fast algorithms of multi-dimensional DCT and DST with input/output in normal orders

Author

Pan Ailing

Author_Institution

Dept. of Electron. Eng., Hangzhou Inst. of Electron. Eng., China

Volume

3

fYear

1993

fDate

19-21 Oct. 1993

Firstpage

537

Abstract

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.<>

Keywords

C language; Chebyshev approximation; digital arithmetic; discrete cosine transforms; signal processing; C language program; Hadamard order; Tchebycheff polynomial; arithmetic operations; fast algorithms; multidimensional DCT; multidimensional DST; normal order input/output; successive order reduction; two-dimensional DCT-IV; Algorithms; Discrete cosine transforms; Discrete transforms; Multidimensional systems; Polynomials; Two dimensional displays;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on

Conference_Location

Beijing, China

Print_ISBN

0-7803-1233-3

Type

conf

DOI

10.1109/TENCON.1993.328043

Filename

328043