نتایج جستجو برای: discrete cosine transform

تعداد نتایج: 265863  

2003
Ronald Scrofano Ju-wook Jang Viktor K. Prasanna

The 2-D discrete cosine transform (DCT) is an integral part of video and image processing; it is used in both the JPEG and MPEG encoding standards. As streaming video is brought to mobile devices, it becomes important that it is possible to calculate the DCT in an energy-efficient manner. In this paper, we present a new algorithm and processing element (PE) architecture for computing the DCT wi...

Journal: :Speech Communication 1998
Ing Yann Soon Soo Ngee Koh Chai Kiat Yeo

This paper illustrates the advantages of using the Discrete Cosine Transform (DCT) as compared to the standard Discrete Fourier Transform (DFT) for the purpose of removing noise embedded in a speech signal. The derivation of the Minimum Mean Square Error (MMSE) ®lter based on the statistical modelling of the DCT coecients is shown. Also shown is the derivation of an over-attenuation factor bas...

Journal: :IEEE Trans. Signal Processing 2003
Vladimir Nikolajevic Gerhard Fettweis

The forward and inverse modified discrete cosine transform (MDCT) are two of the most computational intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw’s recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for pa...

2009
Christopher Santoro Corey Cheng

A novel algorithm is proposed to estimate the fundamental frequencies present in polyphonic acoustic mixtures expressed in a transform domain. As an example, the algorithm operates on Modified Discrete Cosine Transform (MDCT) coefficients in order to demonstrate the utility of the method in commercially available perceptual audio codecs which use the MDCT. An auditory model is developed along w...

Journal: :IEEE Journal on Selected Areas in Communications 1986
Martin Vetterli Adriaan Ligtenberg

An 8-point Fourier-cosine transform chip designed for a data rate of 100 Mbits/s is described. The top-down design is presented step by step, including algorithm modification for VLSI suitability, architectural choices, testing overhead, internal precision assignments, mask generation,, and finally, verification of the layout. A high-level language (C) design tool was developed concurrently wit...

2006
MOHAMMED H. WONDIMAGEGNEHU TETSUYA SHIMAMURA

The least mean square (LMS) algorithm is the most popular adaptive ltering method due to its simplicity and predictable behavior. The convergence properties of the LMS algorithm can be improved by updating the lter coe cients in the transform domain. This paper presents a new transform domain LMS equalizer, called Discrete Cosine Transform Domain Parallel LMS (DCTPLMS) equalizer, which updates ...

2005

The discrete cosine transform (DCT) is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. It is equivalent to a DFT of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), where in some variants the input and/or output data are shifted by half a sampl...

Journal: :IJDCF 2014
Shun Zhang Tiegang Gao Fusheng Yang

A reversible data hiding scheme based on integer DWT and histogram modification is proposed. In the scheme, the cover media is firstly transformed by Integer DWT (Discrete Wavelet Transformation); then information is embedded through the modification of histograms of the middle and high frequency sub-bands of the DWT coefficients. In order to increase the embedding capacity, a multi-level schem...

2004
K. J. Ray Liu C. T. Chiu

In this paper, a new scheme employing the time-recursive approach to compute the discrete cosine transform (DCT) and discrete sine transform (DST) is presented. Using such approach, parallel lattice structure that can dually generate the DCT and DST simultaneously is developed. The resulting architecture is regular, module, and without global communication and can be applied to any transform si...

Journal: :Pattern Recognition Letters 2007
Santi P. Maity Malay Kumar Kundu Tirtha Sankar Das

Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters unaltered. In literatures, typically various transformations like DFT, DCT, Fourier–Mellin and wavelet are used for SS multimedia watermarking but little studies have been attempted so far to see what are the possible fa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید