Results 271 to 280 of about 123,647 (323)

Reversible discrete cosine transform

Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002
In this paper a reversible discrete cosine transform (RDCT) is presented. The N-point reversible transform is firstly presented, then the 8-point RDCT is obtained by substituting the 2 and 4-point reversible transforms for the 2 and 4-point transforms which compose the 8-point discrete cosine transform (DCT), respectively.
Kunitoshi Komatsu, Kaoru Sezaki
openaire   +1 more source

The fractional discrete cosine transform

IEEE Transactions on Signal Processing, 2002
The extension of the Fourier transform operator to a fractional power has received much attention in signal theory and is finding attractive applications. The paper introduces and develops the fractional discrete cosine transform (DCT) on the same lines, discussing multiplicity and computational aspects. Similarities and differences with respect to the
CARIOLARO, GIANFRANCO, ERSEGHE, TOMASO, KRANIAUSKAS P.   +2 more
openaire   +1 more source

The Discrete Cosine Transform (DCT)

2009
The Fourier transform and the DFT are designed for processing complex-valued signals, and they always produce a complex-valued spectrum even in the case where the original signal was strictly realvalued. The reason is that neither the real nor the imaginary part of the Fourier spectrum alone is sufficient to represent (i.e., reconstruct) the signal ...
Wilhelm Burger, Mark J. Burge
openaire   +1 more source

On the discrete cosine transform computation

Signal Processing, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Comments on "Discrete Cosine Transform"

IEEE Transactions on Computers, 1975
In the above correspondence,1 Ahmed et al. proposed a discrete cosine transform (DCT) and compared its performance with the Karhunen-Loeve transform (KLT). They offered empirical evidence showing that the DCT and the KLT compare closely for a number of digital signal processing applications.
openaire   +1 more source

Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms

Circuits, Systems, and Signal Processing, 1984
K R Rao, P Yip
exaly   +2 more sources

Running discrete cosine transform

Journal of Biomedical Engineering, 1992
The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was
openaire   +2 more sources

Canonical transformations of the discrete cosine transform

Signal Processing, 2007
We provide different transformation formulae between the different discrete cosine transform (DCT) types of the same size. The transformations use only diagonal and special lower/upper triangular matrices that minimize the overhead of transformation. These transformations provide a tool for using any of the DCT types as a core module for computing all ...
openaire   +1 more source

On asymmetrical performance of discrete cosine transform

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
The discrete cosine transform (DCT) is considered as a suboptimum transform for many practical source-coding applications. Autoregressive order 1 (AR(1)) source models are good first approximations to several natural signals. It is known that the performance of the DCT depends on the sign of the autocorrelation coefficient of the AR(1) source.
Ali N. Akansu, Richard A. Haddad
openaire   +1 more source

Mixed-radix discrete cosine transform

IEEE Transactions on Signal Processing, 1993
Presents two new fast discrete cosine transform computation algorithms: a radix-3 and a radix-6 algorithm. These two new algorithms are superior to the conventional radix-3 algorithm as they (i) require less computational complexity in terms of the number of multiplications per point, (ii) provide a wider choice of the sequence length for which the DCT
Yuk-Hee Chan, Wan-Chi Siu
openaire   +2 more sources