When network and storage devices become more popular, the digital data more easily and more quickly will be distributed. Can be easily pirated copy and did not limit a large number of multimedia information (images, audio and video). Therefore, people are increasingly concerned about the protection of intellectual property rights of multimedia. Digital watermarking is a useful and the developme...

Discrete cosine and sine transforms closely approximate the Karhunen–Loeve transform for first-order Markov stationary signals with high low correlation coefficients, respectively. sinusoidal can be used in data compression, digital filtering, spectral analysis pattern recognition. Short-time based on discrete are suitable adaptive processing time–frequency of quasi-stationary data. The general...

Weighted (L, L) inequalities are studied for a variety of integral transforms of Fourier type. In particular, weighted norm inequalities for the Fourier, Hankel, and Jacobi transforms are derived from Calderón type rearrangement estimates. The obtained results keep their novelty even in the simplest cases of the studied transforms, the cosine and sine Fourier transforms. Sharpness of the condit...

|In this paper, we propose uni ed systolic arrays for computation of the 1-D and 2-D discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). By decomposing the transforms into evenand odd-numbered frequency samples, the proposed architecture computes the 1-D DCT/DST/DHT. Compared to the conventional methods the proposed systolic arrays exhibit advantages in t...

We study recursive algorithm for computing DCT of lengths N = q 2m (m, q ∈ N, q is odd) due to C. W. Kok [16]. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when m 6 2. We also show that C. W. Kok’s factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, a...

We propose novel hardware accelerator architectures for the most computationally demanding algorithms of the MPEG-4 video compression standard-motion estimation, binary motion estimation (for shape coding), and the forward/inverse discrete cosine transforms (incorporating shape adaptive modes). These accelerators have been designed using general low-energy design philosophies at the algorithmic...

Recently lifting-based integer transforms have received much attention, especially in the area of lossless audio and image coding. The usual approach is to apply the lifting scheme to each Givens rotation. Especially in the case of long transform sizes in audio coding applications, this leads to a considerable approximation error in the frequency domain. This paper presents a multidimensional l...

New algorithms for the computation of orthogonal and biorthogonal modulated lapped transforms (MLTs) are presented. The new structures are obtained by combining the MLT window operators with stages from a recently introduced structure for the type-IV discrete cosine transform (DCT-IV). The net result is fewer multiplications and additions than previously reported algorithms. For the orthogonal ...