A new IDCT-DFT relationship reducing the IDCT computational cost

Author

Diab, Chaouki ; Oueidat, Mohammad ; Prost, Rémy

Author_Institution

Inst. of Appl. & Economic Sci. (ISAE), Beirut, Lebanon

Volume

50

Issue

7

fYear

2002

fDate

7/1/2002 12:00:00 AM

Firstpage

1681

Lastpage

1684

Abstract

This paper reconsiders the discrete cosine transform (DCT) algorithm of Narashima and Peterson (1978) in order to reduce the computational cost of the evaluation of N-point inverse discrete cosine transform (IDCT) through an N-point FFT. A new relationship between the IDCT and the discrete Fourier transform (DFT) is established. It allows the evaluation of two simultaneous N-point IDCTs by computing a single FFT of the same dimension. This IDCT implementation technique reduces by half the number of operations

Keywords

computational complexity; discrete Fourier transforms; discrete cosine transforms; fast Fourier transforms; inverse problems; signal processing; DCT algorithm; DSP; FFT; IDCT computational cost reduction; IDCT-DFT relationship; digital signal processing; discrete Fourier transform; discrete cosine transform algorithm; inverse discrete cosine transform; Chaos; Computational efficiency; Digital signal processing; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Image coding; Signal processing algorithms; Speech coding; Speech processing;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/TSP.2002.1011208

Filename

1011208