Results 251 to 260 of about 1,495,143 (296)
Some of the next articles are maybe not open access.
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 +3 more sources
On the discrete cosine transform computation
Signal Processing, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A New Algorithm to Compute the Discrete Cosine Transform [PDF]
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984 A new algorithm is introduced for the 2^m-point discrete cosine transform. This algorithm reduces the numbeorf multiplications to about half of those required by the existing efficient algorithms, and it makes the system simpler.Granger Associates ...
Lee, Byeong Gi
exaly +1 more source
Discrete cosine transform of encrypted images
2008 15th IEEE International Conference on Image Processing, 2008Processing a signal directly in the encrypted domain provides an elegant solution in application scenarios where valuable signals must be protected from a malicious processing device. In a previous paper we considered the implementation of the ID discrete fourier transform (DFT) in the encrypted domain, by using the homomorphic properties of the ...
Tiziano Bianchi +2 more
openaire +2 more sources
On Computing the Discrete Fourier and Cosine Transforms
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1985An efficient algorithm based on real matrix decomposition is developed for computing a class of sinusoidal transforms, that include the discrete Fourier and cosine transform.
Zhongde Wang
exaly +3 more sources
Comments on "Discrete Cosine Transform"
IEEE Transactions on Computers, 1975In 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 +2 more sources
Running discrete cosine transform
Journal of Biomedical Engineering, 1992The 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, 2007We 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 +2 more sources
On the multiplicative complexity of discrete cosine transforms
IEEE Transactions on Information Theory, 1992Computing the discrete cosine transform (DCT) involves multiplying an arbitrary real vector of length \(N\) by the matrix \(K_ N:=(\cos(2\pi j(2k+1)/(4N)))^{N-1}_{j,k=0}\). The minimum number of nonrational multiplications required to compute the product of an arbitrary real vector of length \(N\) by a real \((N,N)\)-matrix \(M\) is denoted by \(\mu(M)\
Ephraim Feig, Shmuel Winograd
openaire +3 more sources
Mixed-radix discrete cosine transform
IEEE Transactions on Signal Processing, 1993Presents 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