Fault analysis in a doubly fed Induction Generator using Discrete Fourier Transform
faults are analysed i.e. the faults are identified and classified using Discrete Fourier Transform (DFT). The entire work is carried out in Matlab/Simulink platform
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
faults are analysed i.e. the faults are identified and classified using Discrete Fourier Transform (DFT). The entire work is carried out in Matlab/Simulink platform
discrete (finite) Fourier transform. This discrete number operator has distinct Eigen values, which are employed to systematically classify Eigen vectors of the 5D discrete Fourier transform, thus avoiding the ambiguity
drugs as Candesartan Cilexetil (CAN) and Olmesartan Medoxomil (OLM).The use of Discrete Method of Fourier Transform Convoluted Spectra (FF method) and Derivative Ratio Method (D1R method) were found
There are three different way to calculate DFT. First method is using
technique. By using QR code we have propose DWT (Discrete-Wavelet-Transform), DFT (Discrete-Fourier-Transform), DCT (discrete cosinetransform), SVD (singular-value decomposition) methodology for watermarking technique
In today’s world, a large number of data is available on
FFT is a highly efficient procedure to reduce computation time and also
Discrete Fourier transform (DFT) is widespread used in many fields of science and engineering. DFT is implemented with efficient algorithms categorized as Fast Fourier Transform. A fast algorithm is proposed
real signals and deals with their spectrums in the frequency domain by applying discrete fourier transformation. Our main objective is to cluster the protein sequences by considering numerical type
This paper looks at one of the jewels of mathematics, the Fourier
This paper presents a high-speed low-complexity modified radix 25-512
The FFT architecture was reconfigurable for supporting both variable length and multistreaming
This paper discusses the quantitative measure the various types of carcinogenic abnormalities
This paper discusses the quantitative measure for the various types of carcinogenic
Criminal record generally contains personal information about particular person along with the
extract feature vectors using wavelet transform as alternative to the commonly used Discrete Fourier Transform (DFT). Brain Computer Interface is a direct connection between the brain and a computer, without…
Loeve Transform (KLT), Walsh-Hadamard Transform (WHT), Fast Fourier Transform (FFT), Sparse Fast Fourier Transform (SFFT), Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT). The results of simulation
discrete Fourier transform, and the first lowfrequency coefficients (4*5*4) are selected. Then, the first low-frequency coefficients (4*5*4) are transformed by 3D discrete inverse Fourier transform
symbol are Serial to Parallel (S/P) converted. Finally, an Inverse Discrete Fourier Transformation (IDFT) is used to generate the MC-CDMA signal. At the receiver, the guard interval ... removed then a Discrete Fourier…
approximation of feature pyramids in the transform domain, namely, the 2D discrete Fourier transform (2DDFT) or the 2D discrete cosine transform (2DDCT) domain. The proposed method is based
Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and requires less number of computations than that of direct evaluation
Discrete Fourier Transform (DFT) can be implemented very fast using Fast Fourier Transform (FFT). It has various numbers of applications in the field of signal processing
peak signal to noise ratio performance (PSNR) of discrete wavelet transform (DWT)-OFDM system is compared with conventional fast fourier transform (FFT)-OFDM system for colour image transmission, here ... under noisy…
This paper presents a new parallel pipelined architecture to compute Discrete Fourier Transform (DFT) using FFT architecture. This particular architecture uses folding transformation technique as well as register…
computing when large computational problems, as typified by the application of the Discrete Fourier Transform (DFT) to the task of spectrum estimation, could suddenly, with the availability of suitable algorithms
For authors and organisers
Find the right journal for your paper and submit your manuscript.