01_FFT and Signal analysis 激光测振技术基础1.pdf

FFT and Signal-analysis Content Vibration basics What is the Fast Fourier Transformation? Pitfalls of the FFT Sampling: Aliasing Limited time block: “Picket-fence effect” Signal non-periodic in the acquisition time block: Leakage Windowing Displacement Frequency1 d = D sinωnt D T Time Displacement Simplest Form of a Vibrating System Period, Tn in [sec] Frequency, fn= in [Hz = 1/sec] 1 Tn T m k k m ωn= 2 π fn = d = D sin ωt d = D v = = Dω cos ωt dd dt Displacement, d Velocity, v Time D d maximum Conversions: d,v and a ^ v? = Dω = D2πf a = = -Dω2 sin ωt d 2d dt2 a = Dω2 = D4π2f 2 Acceleration, a Time Time v = 0 a minimum 2πf = 1000 for f = 159,1Hz ^ Fourier transformation Time signal FFT Spectrum Inverse Fourier transformation Time signal IFFT Spectrum Fast Important for Fourier Transformation Transformation FFT implementation Of a time signal Into a spectrum DFT Discrete Discrete: Transformation Transformation Fourier samples of a time signal into a spectrum FFT is a fast algorithm for the calculation of a DFT FFT is often used as a synonym for DFT! Fourier series and Fourier transformation Fourier series: Periodic signals are developed into a series of sine and cosine signals (discrete frequency lines) Fourier transformation: Arbitrary signals are transformed into a continuous spectrum The Inventor Jean Baptiste Joseph Fourier (1768 - 1830) Fourier series representation A periodical time signal can be described as a Fourier series: ∑ ∞ ++= )cos( 1 )( tnaatf ?ω =1 0 2 n nn an are the Fourier-coefficients of the amplitudes, ?n of the phases. The calculation of an and ?n is the aim of the Fourier analysis. Fourier- decomposition 0 2 4 6 8 A m p l i t u d e ( m m / s ) 0 2 0 0 0 4 0 0 0 6 0 0 0 8 0 0 0 1 0 0 0 0 - 2 - 1 0 1 2 A m p l i t u d e ( m m / s ) Z e i t ( m s ) - 2 - 1 0 1 2 A m p l i t u d e ( m m / s ) = + 21.03.2011? Polytec GmbH # 12 0 2000 4000 6000 8000 10000 -10 -8 -6 -4 -2 A m p l i t u d e ( m m / s )