Restructured recursive DCT and DST algorithms

The discrete cosine transform (DCT) and the discrete sine transform (DST) have found wide applications in speech and image processing, as well as telecommunication signal processing for the purpose of data compression, feature extraction, image reconstruction, and filtering. In this paper, we present new recursive algorithms for the DCT and the DST. The proposed method is based on certain recursive properties of the DCT coefficient matrix, and can be generalized to design recursive algorithms for the 2-D DCT and the 2-D DST. These new structured recursive algorithms are able to decompose the DCT and the DST into two balanced lower-order subproblems in comparison to previous research works. Therefore, when converting our algorithms into hardware implementations, we require fewer hardware components than other recursive algorithms. Finally, we propose two parallel algorithms for accelerating the computation. >

[1]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[2]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[3]  N. Cho,et al.  Fast algorithm and implementation of 2-D discrete cosine transform , 1991 .

[4]  Zoran Cvetkovic,et al.  New fast recursive algorithms for the computation of discrete cosine and sine transforms , 1992, IEEE Trans. Signal Process..

[5]  Roger W. Hockney,et al.  A Fast Direct Solution of Poisson's Equation Using Fourier Analysis , 1965, JACM.

[6]  ZHONGDE WANG.  On computing the discrete Fourier and cosine transforms , 1985, IEEE Trans. Acoust. Speech Signal Process..

[7]  Henrique S. Malvar.  Fast computation of discrete cosine transform through fast Hartley transform , 1986 .

[8]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[9]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

[10]  Hsieh S. Hou.  A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[11]  Michael T. Heideman,et al.  Computation of an odd-length DCT from a real-valued DFT of the same length , 1992, IEEE Trans. Signal Process..

[12]  Henrique S. Malvar,et al.  Corrections to "Fast Computation of the Discrete Cosine Transform and the Discrete Hartley Transform" , 1988 .

[13]  Zhongde Wang.  Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[14]  O. K. Ersoy,et al.  A unified approach to the fast computation of all discrete trigonometric transforms , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[15]  MUNSI ALAUL HAQUE,et al.  A two-dimensional fast cosine transform , 1985, IEEE Trans. Acoust. Speech Signal Process..

[16]  Farhad Kamangar,et al.  Fast Algorithms for the 2-D Discrete Cosine Transform , 1982, IEEE Transactions on Computers.

[17]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[18]  K. R. Rao,et al.  A Fast Computational Algorithm for the Discrete Sine Transform , 1980, IEEE Trans. Commun..

[19]  P. Yip,et al.  Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms , 1984 .

[20]  Nam Ik Cho,et al.  On the regular structure for the fast 2-D DCT algorithm , 1993 .

[21]  Ephraim Feig,et al.  Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..

[22]  A. Gupta,et al.  An efficient FFT algorithm based on the discrete sine transform , 1991, IEEE Trans. Signal Process..

[23]  A. Gupta,et al.  A fast recursive algorithm for the discrete sine transform , 1990, IEEE Trans. Acoust. Speech Signal Process..

[24]  Tapan K. Sarkar,et al.  A Generalized Approach to Direction Finding , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.

[25]  Hsieh S. Hou,et al.  The Fast Hartley Transform Algorithm , 1987, IEEE Transactions on Computers.

[26]  Zhong-De Wang.  A fast algorithm for the discrete sine transform implemented by the fast cosine transform , 1982 .

[27]  Weiping Li,et al.  A new algorithm to compute the DCT and its inverse , 1991, IEEE Trans. Signal Process..

[28]  J. Makhoul.  A fast cosine transform in one and two dimensions , 1980 .

[29]  Haralick.  A Storage Efficient Way to Implement the Discrete Cosine Transform , 1976, IEEE Transactions on Computers.

[30]  K. L. Ho,et al.  A new two-dimensional fast cosine transform algorithm , 1991, IEEE Trans. Signal Process..

[31]  P. Yip,et al.  THE DECIMATION-IN-FREQUENCY ALGORITHMS FOR A FAMILY OF DISCRETE SINE AND COSINE TRANSFORMS* , .

[32]  Shirley Nian-Chang Cheng,et al.  Application of the Sine-Transform Method in Time-of-Flight Positron-Emission Image Reconstruction Algorithms , 1985, IEEE Transactions on Biomedical Engineering.