abstract most structural failures are because of break in consisting materials. these breaks are initiated with crack extension, which is a serious threat to the behavior of structure, so different methods have been developed for distinguishing and showing such cracks. meanwhile, the new methods based on original wavelet transform are efficient and very important in the subject of signals. the ...

The classical method of numerically computing the Fourier transform of digitizedfunctions in one or in ddimensions is the so-called discrete Fourier transform ( D F T ) , efficiently implemented as Fast Fourier Transform ( F F T ) algorithms. In m n y cases the D F T is not an adequate appmximation of the continuous Fourier transform. The method presented in this contribution provides accurate ...

A new method based on principal component analysis (PCA) and artificial neural networks (ANN) is proposed for fault diagnosis of gearboxes. Firstly the six different base wavelets are considered, in which three are from real valued and other three from complex valued. Two wavelet selection criteria Maximum Energy to Shannon Entropy ratio and Maximum Relative Wavelet Energy are used and compared...

The terms Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) are used to denote efficient and fast algorithms to compute the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) respectively. The FFT/IFFT is widely used in many digital signal processing applications and the efficient implementation of the FFT/IFFT is a topic of continuous research.

In the modeling of continuous time systems, there is a need to convert the analog system to a discrete time system. The transform frequently encountered in the literature is the impulse invariant transform. This transform has proven to be inadequate for biological system modeling. In this paper we will review the available linear transforms and derive three new transforms, namely the centered s...

The discrete Fourier transform (DFT) maps a nite number of discrete time-domain samples to the same number of discrete Fourier-domain samples. Being practical to compute, it is the primary transform applied to real-world sampled data in digital signal processing. The DFT has special relationships with the discrete-time Fourier transform and the continuous-time Fourier transform that let it be u...