3.2 Analysis of acoustic emission signals
Typical applications for the Fast Fourier Transformation (FFT) are found in the areas of acoustics,
electronics and optic. This paper focuses on the Fourier Transformation for production engineering.
The Fast Fourier Transformation (FFT) is an optimized variant of the Discrete Fourier Transformation
(DFT). It is an algorithm that uses the calculated intermediate data in order to minimize any arithmetic
operations. By using the DFT, respectively FFT, the honing process should be researched more from
the point of signal processing. Therefore, the motivation is to identify the important frequencies of the
sampled signal. The next step is to identify the amplitude to these frequencies by applying a
spectrogram. The implementation is carried out with MATLAB from MathWorks. The basis for the
Fast Fourier Transformation is a sampled signal with a high sampling rate. This requirement is
existent at a sampling rate of 200 Mb/s. The memory exists in the form of an ASCII-File. The
evaluation results show the representation of the measuring signal of the accelerometer, the oscillating
stroke, the spectrogram and the FFT.