A cyclic correlated structure for the realization of discrete cosine transform

The authors propose using the correlated cosine structure (CCS) for the computation of the discrete cosine transform (DCT). This structure has circulant property and is most suitable for the hardware realization. They show that there exists a close relationship between the CCS and the DCT. In such a case, a 2/sup m/ length DCT can be decomposed recursively into shorter length CCS and DCT. This new approach results in very simple and straightforward structure and gives the minimum number of multiplications for its realization. >

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

[2]  Okan K. Ersoy,et al.  A two-stage representation of DFT and its applications , 1987, IEEE Trans. Acoust. Speech Signal Process..

[3]  Okan K. Ersoy.  Semisystolic Array Implementation of Circular, Skew Circular, and Linear Convolutions , 1985, IEEE Transactions on Computers.

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

[5]  Okan K. Ersoy.  On relating discrete Fourier, sine, and symmetric cosine transforms , 1985, IEEE Trans. Acoust. Speech Signal Process..

[6]  S.A. White,et al.  Applications of distributed arithmetic to digital signal processing: a tutorial review , 1989, IEEE ASSP Magazine.

[7]  P. Duhamel,et al.  New 2nDCT algorithms suitable for VLSI implementation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

[9]  M. Vetterli,et al.  Simple FFT and DCT algorithms with reduced number of operations , 1984 .

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

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

[12]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

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