نتایج جستجو برای: frequency domain using fast fourier transform and discrete wavelet transform in data mining stage

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

1999
Faramarz Fekri Russell M. Mersereau Ronald W. Schafer

In this paper, we develop the theory of the wavelet transform over Galois elds. To avoid the limitations inherent in the number theoretic Fourier transform over nite elds, our wavelet transform relies on a basis decomposition in the time domain rather than in the frequency domain. First, we characterize the in nite dimensional vector spaces for which an orthonormal basis expansion of any sequen...

Journal: :Circuits and Systems 2011
Guo-Sheng Hu Feng-Feng Zhu

The chirplet transform is the generalization form of fast Fourier Transform, short-time Fourier transform, and wavelet transform. It has the most flexible time frequency window and successfully used in practices. However, the chirplet transform has not inherent inverse transform, and can not overcome the signal reconstructing problem. In this paper, we proposed the improved chirplet transform (...

1999
J. V. Avadhanulu M. Mathew Thippur V. Sreenivas

Development of robust and efficient front-end is crucial for robust ASR. Proper time and frequency resolution of the TFR of speech, motivated by the auditory models is considered an important factor for robustness. An efficient method of realizing a variable resolution TFR using DTFT/Goertzel algorithm is proposed instead of the standard FFT based approach. It is shown that the new representati...

2011
Andreas Uhl Andreas Vécsei Georg Wimmer

In this paper, we present variants of the Dual-Tree Complex Wavelet Transform (DT-CWT) in order to automatically classify endoscopic images with respect to the Marsh classi cation. The feature vectors either consist of the means and standard deviations of the subbands from a DT-CWT variant or of the Weibull parameter of these subbands. To reduce the e ects of di erent distances and perspectives...

2012
Shilpi Gupta Upena D. Dalal

In this paper, the Bit Error Rate (BER), performance of conventional Discrete Fourier Transform (FFT) OFDM system is compared with Nonconventional Discrete Cosine Transform (DCT)OFDM system in AWGN and Rayleigh fading environment. Performance has been given with conventional mapping schemes like BPSK, QPSK and nonconventional mapping schemes like DQPSK and π/4 DQPSK. Simulation results show tha...

2015
V. S. Santhosh Kumar B. Vidhya

--In OFDM systems, Fast Fourier transform (FFT) is used for frequency translation, and recently Discrete Wavelet Transform (DWT) has replaced FFT for frequency translation. 16-QAM (Quadrature amplitude modulation) scheme has been used in the OFDM system for both DWT and FFT based models. This work presents a modified OFDM system that is based on a low complexity interleaving process which is ap...

1997
Ajit S. Bopardikar Raghuveer M. Rao B. Suryanarayana Adiga

This paper, introduces a new lter bank structure called the perfect reconstruction circular convolution (PRCC) lter bank. These lter banks satisfy the perfect reconstruction properties, namely, the paraunitary properties in the discrete frequency domain. We further show how the PRCC analysis and synthesis lter banks are completely implemented in this domain and give a simple and a exible method...

Journal: :Journal of the Japan Society for Precision Engineering, Contributed Papers 2005

2012
Vaishali Kulkarni

In this paper, we propose Speaker Identification using the frequency distribution of various transforms like DFT (Discrete Fourier Transform), DCT (Discrete Cosine Transform), DST (Discrete Sine Transform), Hartley, Walsh, Haar and Kekre transforms. The speech signal spoken by a particular speaker is converted into frequency domain by applying the different transform techniques. The distributio...

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

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