Results 201 to 210 of about 8,865 (256)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1974
A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Nasir Ahmed 0001 +2 more
exaly +3 more sources
A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Nasir Ahmed 0001 +2 more
exaly +3 more sources
On the Computation of the Discrete Cosine Transform
IRE Transactions on Communications Systems, 1978An N -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a 2N -point DFT.
M Narasimha
exaly +2 more sources
The fractional discrete cosine transform
IEEE Transactions on Signal Processing, 2002The 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 +2 more
exaly +2 more sources
On Computing the Discrete Cosine Transform
IEEE Transactions on Computers, 1978Haralick has shown that the discrete cosine transform of N points can be computed more rapidly by taking two N-point fast Fourier transforms (FFT's) than by taking one 2N-point FFT as Ahmed had proposed. In this correspondence, we show that if Haralick had made use of the fact that the FFT's of real sequences can be computed more rapidly than general ...
Ben-Dau Tseng, William C. Miller
openaire +2 more sources
Discrete cosine transform filtering
Signal Processing, 1990Circular convolution-multiplication relationships for the discrete cosine transform (DCT) that are similar to those for the discrete Fourier transform (DFT) are developed. The relations are valid if the filter frequency response is real and even. Two fairly simple relations are developed.
Bowonkoon Chitprasert, K. R. Rao 0001
openaire +1 more source
Reversible discrete cosine transform
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002In 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 Discrete Cosine Transform (DCT)
2009The 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
Binary Discrete Cosine and Hartley Transforms
IEEE Transactions on Circuits and Systems I: Regular Papers, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saad Bouguezel +2 more
openaire +2 more sources
On the discrete cosine transform computation
Signal Processing, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources