A new IDCT-DFT relationship reducing the IDCT computational cost

@article{Diab2002ANI,
  title={A new IDCT-DFT relationship reducing the IDCT computational cost},
  author={Chaouki Diab and Mohamad Oueidat and R{\'e}my Prost},
  journal={IEEE Trans. Signal Processing},
  year={2002},
  volume={50},
  pages={1681-1684}
}
This paper reconsiders the discrete cosine transform (DCT) algorithm of Narashima and Peterson in order to reduce the computational cost of the evaluation of -point inverse discrete cosine transform (IDCT) through an -point FFT. A new relationship between the IDCT and the discrete Fourier transform (DFT) is established. It allows the evaluation of two simultaneous -point IDCTs by computing a single FFT of the same dimension. This IDCT implementation technique reduces by half the number of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

On the computation of the discrete cosine transform,”IEEE

  • M. J. Narashima, A. M. Peterson
  • Trans. Commun. , vol
  • 1978
Highly Influential
8 Excerpts

Cosine Transform: Algorithms, Advantages, Applications

  • K. R. Rao, P. Yip, Discrete
  • 1990
3 Excerpts

Fast fourier transforms: A tutorial review and a state of the art

  • P. Duhamel, M. Vetterli
  • Signal Process. , vol. 19, no. 4, pp. 259–299…
  • 1990
1 Excerpt

Discrete cosine transform Simple FFT and DCT algorithms with reduced number of operations

  • K. R. Rao
  • Signal Process .
  • 1984

Simple FFT and DCT algorithms with reduced number of operations

  • M. Vetterli, H. J. Nussbaumer
  • Signal Process. , vol. 6, pp. 267–278, Aug. 1984…
  • 1984
2 Excerpts

Chaouki Diab (M’01) received the electrical engineering degree from the Lebanese University, Beirut, Lebanon

  • H. J. Nussbaumer
  • Fast Fourier Transform and Convolution Algorithms
  • 1982
1 Excerpt

Similar Papers

Loading similar papers…