To solve the weakly-singular Volterra integro-differential equations, the combined method of the Laplace Transform Method and the Adomian Decomposition Method is used. As a result, series solutions of the equations are constructed. In order to explore the rapid decay of the equations, the pade approximation is used. The results present validity and great potential of the method as a powerful al...

Abstract - Use of efficient signal processing tools (SPTs) to extract proper indices for fault detection in induction motors (IMs) is the essential part of any fault recognition procedure. The Part1 of the two parts paper focuses on Fourier-based techniques including fast Fourier transform and short time Fourier transform. In this paper, all utilized SPTs which have been employed for fault fete...

In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...

It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...

The performance of Orthogonal Frequency Division Multiple Access (OFDMA) system degrades significantly in doubly dispersive channels. This is due to the fact that exponential sub-carriers do not match the singular functions of this type of channels. To solve this problem, we develop a system whose sub-carriers are chirp functions. This is equivalent to exploiting Fractional Fourier Transform (F...