Digital Signal Processing

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

| Page Angelo Farina UNIPR | All Rights Reserved | Confidential Digital sound processing Convolution Digital Filters FFT.
DCSP-12 Jianfeng Feng
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
ACHIZITIA IN TIMP REAL A SEMNALELOR. Three frames of a sampled time domain signal. The Fast Fourier Transform (FFT) is the heart of the real-time spectrum.
Data Processing Chapter 3 As a science major, you will all eventually have to deal with data. As a science major, you will all eventually have to deal.
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Fourier series With coefficients:. Complex Fourier series Fourier transform (transforms series from time to frequency domain) Discrete Fourier transform.
Filtering Filtering is one of the most widely used complex signal processing operations The system implementing this operation is called a filter A filter.
Chapter 8: The Discrete Fourier Transform
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
FFT-based filtering and the Short-Time Fourier Transform (STFT) R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
First semester King Saud University College of Applied studies and Community Service 1301CT.
Leakage & Hanning Windows
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
FT Representation of DT Signals:
… Representation of a CT Signal Using Impulse Functions
Discrete-Time and System (A Review)
ELEC ENG 4035 Communications IV1 School of Electrical & Electronic Engineering 1 Section 2: Frequency Domain Analysis Contents 2.1 Fourier Series 2.2 Fourier.
Ni.com Data Analysis: Time and Frequency Domain. ni.com Typical Data Acquisition System.
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
Power Spectral Density Function
The Wavelet Tutorial: Part3 The Discrete Wavelet Transform
Digital Signal Processing
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
111 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
ECE 4710: Lecture #6 1 Bandlimited Signals  Bandlimited waveforms have non-zero spectral components only within a finite frequency range  Waveform is.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Vibrationdata 1 Unit 9 White Noise FFT. Vibrationdata 2 Fourier Transform, Sine Function A Fourier transform will give the exact magnitude and frequency.
Professor A G Constantinides 1 The Fourier Transform & the DFT Fourier transform Take N samples of from 0 to.(N-1)T Can be estimated from these? Estimate.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Chapter 6 Spectrum Estimation § 6.1 Time and Frequency Domain Analysis § 6.2 Fourier Transform in Discrete Form § 6.3 Spectrum Estimator § 6.4 Practical.
§ 4.1 Instrumentation and Measurement Systems § 4.2 Dynamic Measurement and Calibration § 4.3 Data Preparation and Analysis § 4.4 Practical Considerations.
Vibrationdata 1 Unit 6a The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
revision Transfer function. Frequency Response
GG313 Lecture 24 11/17/05 Power Spectrum, Phase Spectrum, and Aliasing.
Time frequency localization M-bank filters are used to partition a signal into different frequency channels, with which energy compact regions in the frequency.
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
Vibrationdata 1 Power Spectral Density Function PSD Unit 11.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Power Spectral Estimation
Learning from the Past, Looking to the Future James R. (Jim) Beaty, PhD - NASA Langley Research Center Vehicle Analysis Branch, Systems Analysis & Concepts.
1 Chapter 8 The Discrete Fourier Transform (cont.)
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
UNIT-II FOURIER TRANSFORM
Chapter 4 Discrete-Time Signals and transform
Fourier series With coefficients:.
CS 591 S1 – Computational Audio
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
MECH 373 Instrumentation and Measurements
3.1 Introduction Why do we need also a frequency domain analysis (also we need time domain convolution):- 1) Sinusoidal and exponential signals occur.
Data Processing As a science major, you will all eventually have to deal with data. All data has noise Devices do not give useful measurements; must convert.
FFT-based filtering and the
Sampling rate conversion by a rational factor
Multi-resolution analysis
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
Ideal Filters One of the reasons why we design a filter is to remove disturbances Filter SIGNAL NOISE We discriminate between signal and noise in terms.
Chapter 8 The Discrete Fourier Transform
Leakage Error in Fourier Transforms
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Lec.6:Discrete Fourier Transform and Signal Spectrum
Data Processing Chapter 3
Presentation transcript:

Digital Signal Processing Modal analysis and testing S. Ziaei Rad

Fourier Analysis Fourier series Fourier Transform Discrete Fourier series S. Ziaei-Rad

Fourier series Assume that x(t) is a periodic function in time. S. Ziaei-Rad

Fourier series (Alternative form) B- S. Ziaei-Rad

Fourier Transform A non-periodic function x(t) which satisfies the condition: Can be represented by: where S. Ziaei-Rad

Fourier Transform (Alternative form) And S. Ziaei-Rad

Discrete Fourier Transform (DFT) A function which is defined only at N discrete points can be represented by a finite series. where S. Ziaei-Rad

Discrete Fourier Transform Alternative form Note that: This form of DFT is most commonly used on digital spectrum analyser. The DFT assumes that the function x(t) is periodic. It is important to realize that in the DFT, there are just a discrete number of items of data in either form, i.e. N values for x and N values for Fourier series. S. Ziaei-Rad

DFT Example Let N=10 In time domain we have: In frequency domain, we have: or S. Ziaei-Rad

Discrete Fourier Transform (DFT) x(t) IS PERIODIC IN (FINITE) TIME T ALSO IS DEFINED ONLY AT N DISCRETE POINTS WHERE Etc. * S. Ziaei-Rad

DFT Spectrum S. Ziaei-Rad

DFT Spectrum S. Ziaei-Rad

DFT Spectrum S. Ziaei-Rad

DFT 1- The input signal is digitized by an A-D converter. 2- The input is recorded as a set of N discrete values, evenly spaced in period T. 3-The sample is periodic in time T. 4- There is a relation between the sample length T, the number of discrete values N, the sampling (or digitizing) rate and the range of resolution of the frequency spectrum, i.e. . is called the Nyquist frequency. S. Ziaei-Rad

DFT 1- Usually, the size of transform (N) is fixed for an analyser, therefore the frequency range and frequency resolution is only determined by the length of the sample. 2- The basic equation (*) will be used to determine the coefficient S. Ziaei-Rad

DFT The basic equation that is solved to determine spectral composition is: ** or S. Ziaei-Rad

FFT - Leakage - Averaging - Windowing - Filtering Some efforts has been devoted to equation (**) for calculation of spectral coefficients. Cooley and Tukey (1960) introduced an algorithm called “Fast Fourier Transform (FFT)”. The method requires N to be an integral power of 2 and the values usually taken is between 256 to 4096. There are number of features of digital Fourier analysis, if not properly treated, can give rise to erroneous results. These are generally the result of discretisation approximation and the limited length of the time history. - Aliasing - Zooming - Leakage - Averaging - Windowing - Filtering S. Ziaei-Rad

Aliasing - Aliasing is a problem from discretisation of the originally continuous time history. - With this descretisation process, the existence of very high frequency in the original signal may well be misinterpreted if the sampling rate is too slow. The phenomenon of aliasing a- Low-frequency signal b- High-frequency signal S. Ziaei-Rad

Leakage - Leakage is a direct consequence of a finite length of time history. In Fig. a, the signal is perfectly periodic in the time window T and the spectrum is a single line. In Fig. b, the periodicity assumption is not valid and the spectrum is not at a single frequency. Energy has ‘leaked’ into a number of spectral lines in close to the true frequency. Leakage is a serious problem in many application of DSP, including FRF measurements. S. Ziaei-Rad

Leakage S. Ziaei-Rad

Leakage Ways of avoiding leakage: Changing the duration of the measurement sample length to match any underlying periodicity in the signal. However, it is difficult to determine the period of signal. Increasing the duration of the measurement period, T, so that the separation between spectral lines is finer. Adding zeros to the end of the measured sample (zero padding) In this way we partially achieving the preceding result but without requiring more data. Or by modifying the signal sample obtained in such a way to reduce the severity of leakage. The process is called ‘windowing’. S. Ziaei-Rad

Windowing - In many situation, the most practical solution to the leakage problem is windowing. - There are a range of different windows for different classes of problems. Windowing is applied to the time signal before performing the Fourier Transform. x(t) measured signal w(t) window profile Or in Frequency Domain Where * denotes the convolution process. S. Ziaei-Rad

Windowing Hanning Exponential Boxcar Cosine-taper S. Ziaei-Rad

Windowing Boxcar Hanning Cosine-taper Exponential S. Ziaei-Rad

Windowing S. Ziaei-Rad

Effect of Hanning Window on Discrete Fourier Transform S. Ziaei-Rad

Filtering -This is another signal conditioning process which has a direct parallel with windowing. In filtering, we simply multiply the original signal spectrum by the frequency characteristic of the filter. or in time domain Common types of filters are: High pass Low pass Narrow-band Notch S. Ziaei-Rad

Filtering Frequency and time domain characteristics of common filters Narrow-band High-pass Notch Band-limited Frequency and time domain characteristics of common filters S. Ziaei-Rad

Improving resolution Inadequate frequency resolution especially at lower end of the frequency range and for lightly-damped systems occurs because of -limited number of discrete points available - maximum frequency range to be covered - the length of time sample Possible actions to improve the resolution Increasing transform size Zero padding Zoom S. Ziaei-Rad

Increasing transform size An immediate solution to this problem would be to use larger transform. This gives finer resolution around the region of interest. This caries the penalty of providing more information than required. Until recently, the time and storage requirements to perform the DFT were a limiting factor. - Transform size of order 2000 to 8000 are standard. S. Ziaei-Rad

Zero padding To maintain the same overall frequency range, but to increase resolution by n, a signal sample of n times the duration is needed. One way is to add a series of zeros to the short sample of actual signal to create a new sample which is longer than the original measurement and thus provide the desire finer resolution. The fact is that no additional have been provided while apparently greater detail in the spectrum is achieved. It is not a genuinely finer spectrum, rather it is the coarser spectrum that interpolated and smoothed by the extension of the analysed record. An example of the effect and potential dangers of zero padding is shown in the next slide. S. Ziaei-Rad

Zero padding Results using zero padding to improve resolution. a- DFT of data between 0 to T1 b- DFT of data padded to T2 c- DFT of full record 0 to T2 S. Ziaei-Rad

Zoom - The common solution to the need for finer frequency resolution is to zoom on the frequency range of interest and to concentrate all the lines into a narrow band between . There are different ways of doing this but perhaps the easiest one is to use a frequency shifting process coupled with a controlled aliasing device. Spectrum of signal Band-pass filter S. Ziaei-Rad

Averaging When analyzing random vibrations signal, we obtain estimates for the spectral densities and correlation functions which are used to characterize this type of signal. Generally, it is necessary to perform an averaging process, involving several individual time records, before a confident results is obtained. Two major considerations which determine the number of average: - the statistical reliability - the removal of random noise from the signals S. Ziaei-Rad

Different interpretations of multi-sample averaging Sequential Overlap S. Ziaei-Rad