We present algorithms for the discrete cosine transform (DCT) and discrete sine transform
(DST), of types II and III, that achieve a lower count of real multiplications and additions than …

A new fast pruning algorithm is proposed for computing the N/sub 0/lowest frequency
components of a length-N discrete cosine transform, where N/sub 0/is any integer less than …

We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine
transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and its …

We present an unified parallel architecture for four of the most important fast orthogonal
transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier …

The non-in-place input mapping and the subsequent bit-reversal stage for the computation
of the fast discrete cosine transform (DCT) are studied. The redundancies associated with …

This paprr presents inethoi-ls to compuie the locils of nll viewpoints froin which feoturcrs on
known polyhedral nhjecls con be viewed in their entirety without being nccluAcd by ailything …

An extension of one of the fastest existing algorithms for the computation of the two-
dimensional (2D) discrete cosine transform (DCT) is presented and a 2D fast cosine …

This paper presents a recursive method for function evaluation. The proposal argues for the
use of a more complete primitive, namely a weighted sum, which converts the calculation of …

A unified approach to the fast computation of orthogonal discrete sinusoidal transforms for
real data sequences is presented. Various types of discrete sinusoidal transforms (DCT) and …

The conventional discrete cosine transform (DCT) is used to perform two-dimensional (2-D)
interpolation of real sequences. It is shown that with a suitble modification of the DCT …