New fast recursive algorithms for the computation of discrete cosine and sine transforms. (English) Zbl 0758.65087

Cvetković, Zoran; Popović, Miodrag V.

IEEE Trans. Signal Process. 40, No. 8, 2083-2086 (1992).

This paper proposes fast recursive algorithms for computing the discrete sine transform (DST) and the discrete cosine transform (DCT). In this proposal, an \(N\)-point DST or DCT is computed from two \(N/2\)-point DST’s or DCT’s. Comparing this to the conventional implementations, the proposed algorithms have less multiplications by 2, and the add operations are better positioned giving rise to faster computation.

Reviewer: Y.Kobayashi

MSC:

65T50

Numerical methods for discrete and fast Fourier transforms

Keywords:

high speed implementation; comparison of algorithms; fast recursive algorithms; discrete sine transform; discrete cosine transform