Discrete Fourier Transform(2) Prof. Siripong Potisuk.

Slides:



Advertisements
Similar presentations
10.1 fourier analysis of signals using the DFT 10.2 DFT analysis of sinusoidal signals 10.3 the time-dependent fourier transform Chapter 10 fourier analysis.
Advertisements

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.
Sampling theory Fourier theory made easy
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Let’s go back to this problem: We take N samples of a sinusoid (or a complex exponential) and we want to estimate its amplitude and frequency by the FFT.
Digital Signal Processing
CEN352, Dr. Ghulam Muhammad King Saud University
Chapter 8: The Discrete Fourier Transform
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
FFT-based filtering and the Short-Time Fourier Transform (STFT) R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Course 2007-Supplement Part 11 NTSC (1) NTSC: 2:1 interlaced, 525 lines per frame, 60 fields per second, and 4:3 aspect ratio horizontal sweep frequency,
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
Chapter 12 Fourier Transforms of Discrete Signals.
Continuous-time Signal Sampling Prof. Siripong Potisuk.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
Continuous-Time Signal Analysis: The Fourier Transform
Continuous Time Signals All signals in nature are in continuous time.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
FT Representation of DT Signals:
Echivalarea sistemelor analogice cu sisteme digitale Prof.dr.ing. Ioan NAFORNITA.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Discrete-Time and System (A Review)
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.
GCT731 Fall 2014 Topics in Music Technology - Music Information Retrieval Overview of MIR Systems Audio and Music Representations (Part 1) 1.
Lecture 1 Signals in the Time and Frequency Domains
Digital Signal Processing
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
8.1 representation of periodic sequences:the discrete fourier series 8.2 the fourier transform of periodic signals 8.3 properties of the discrete fourier.
Interpolation and Pulse Shaping
Digital Signal Processing – Chapter 10
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Discrete Fourier Transform Prof. Siripong Potisuk.
The Discrete Fourier Transform 主講人:虞台文. Content Introduction Representation of Periodic Sequences – DFS (Discrete Fourier Series) Properties of DFS The.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
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.
Real time DSP Professors: Eng. Julian S. Bruno Eng. Jerónimo F. Atencio Sr. Lucio Martinez Garbino.
Fourier Analysis of Discrete Time Signals
Pre-Class Music Paul Lansky Six Fantasies on a Poem by Thomas Campion.
Chapter 5 Finite-Length Discrete Transform
2D Sampling Goal: Represent a 2D function by a finite set of points.
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
Fourier Analysis Using the DFT Quote of the Day On two occasions I have been asked, “Pray, Mr. Babbage, if you put into the machine wrong figures, will.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
The Discrete Fourier Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.
Continuous-time Signal Sampling
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 14 FFT-Radix-2 Decimation in Frequency And Radix -4 Algorithm University of Khartoum Department.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Chapter 4 Discrete-Time Signals and transform
CS 591 S1 – Computational Audio
BME452 Biomedical Signal Processing
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
FFT-based filtering and the
Sampling and Reconstruction
Fourier Analysis of Signals Using DFT
2D Fourier transform is separable
Sampling and the Discrete Fourier Transform
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Interpolation and Pulse Shaping
Fourier Analyses Time series Sampling interval Total period
Rectangular Sampling.
APPLICATION of the DFT: Estimation of Frequency Spectrum
Chapter 3 Sampling.
Lec.6:Discrete Fourier Transform and Signal Spectrum
Electrical Communications Systems ECE
Presentation transcript:

Discrete Fourier Transform(2) Prof. Siripong Potisuk

Digital Frequency X(e j  ) is simply a frequency-scaled version of X(j  )  Normalization of the frequency axis so that  =  s in X(j  ) is normalized to  = 2  for X(e j  ) Or F = F s in X(F) is normalized to f = 1 for X(f)

Frequency Conversion

Spectral Analysis via the DFT An important application of the DFT is to numerically determine the spectral content of signals. However, the extent to which this is possible is limited by two factors: 1. truncation of the signal  causes leakage 2. frequency domain sampling  causes picket fence effect & time-domain aliasing

Spectral Leakage Two theoretical assumptions about the sampled sequence when computing DFT: 1) periodic 2) continuous and band-limited to the folding freq. Spectral leakage = the presence of harmonics Caused by amplitude discontinuity in the sampled sequence resulting from signal truncation (i.e.,a wrong choice of N) such that the 2 nd assumption is violated.

Amplitude Discontinuity Truncation of a 32-point, 1-Hz sinusoidal sequence and the resulting periodic extension using N = 16 (top) and N = 18 samples (bottom)

Signal samples and spectra without (top) and with (bottom) spectral leakage

Signal Truncation & Spectral Leakage where w(n) is a rectangular window

And,

Spectral Leakage caused by sidelobes of the ‘sinc’ function

Commonly-used Windowing Functions

Windowing operation: original sequence (top), window (middle), and windowed sequence (bottom) after pointwise multiplication

Spectral leakage reduction by windowing operation

Frequency Domain Sampling Time-domain sampling: the choice of T s determines whether the undesirable aliasing in the frequency domain will occur. Frequency-domain sampling: the choice of N or the number of DFT points determines whether the undesirable aliasing in the time domain will occur. Also, the inability of the DFT to observe the spectrum as a continuous function causes the picket- fence effect.

Picket-fence Effect Looking at an FFT spectrum is a little like looking at a mountain range through a picket fence. In general, the peaks in an FFT spectrum will be measured too low in level, and the valleys too high. Size of the picket determined by the frequency spacing:

1) Spectral peak is midway between sample locations. 2) Each sidelobe peak occurs at a sample location. Picket-fence Effect The effect is reduced by increasing the frequency spacing, i.e., increase N, the number of DFT points Zero-pad the original sequence to M > N points M must be a power of 2 if the Fast Fourier Transform (FFT) algorithm is used Choice of M depends on the frequency components in the original sequence

Effect of Zero Padding The resulting spectrum is an interpolated version of the original spectrum, but with reduced frequency spacing Does not recover information lost by the sampling process Better detailed signal spectrum with a finer frequency resolution obtained by adding more data samples (i.e., longer sequence of data) Frequency resolution limited by the Raliegh Limit

Zero-padding effect on DFT calculations of a 12-pt sequence of an analog signal containing 10-Hz and 25-Hz sinusoidal components sampled at 100 Hz with: (A) no zero padding, (B) 4-point zero-padding, and (C) 16-point zero-padding.

Example: Consider a noise-free sequence with a single sinusoidal Spectral component at Hz and sampled at 1024 Hz. Determine the locations of the spectrum peaks for N = 256 and 2048 zero-padded DFT computational points. Also, sketch both spectra. Comment on the presence of spectral leakage and picket- Fence effect.

EX. Consider the signal which is sampled starting at time t = 0 with an ideal sampler (i.e., no pre-filter) operating at a 10 kHz rate. A 100-point DFT of the first 100 samples of this signal is computed. (a) Determine the approximate values for k (in the range of 0 to 99) at which spectral peaks will be observed. Also, give the approximate amplitude of these peaks. (b) For each spectral peaks in (a), state whether or not that peak will exhibit spectral leakage and picket-fence effect.

Example: A 1024-point DT sequence was obtained from sampling an analog signal at 1024 Hz. (a) Determine the frequency spacing if a 2048-pt DFT calculation with zero-padding is performed. (b) It is required that the frequency resolution in the spectrum calculation without zero-padding be less than 0.5 Hz, determine the number of FFT data points needed.

Time-domain Aliasing Caused by periodic assumption of the time- domain sequence Regular  circular or cyclic convolution Implication on discrete-time system analysis Zero-pad the time-domain sequence such that # of DFT points = L+P  1 L, P are the lengths of the two sequences to be convolved

Example Consider the following two 4-point sequences: Compute by direct convolution and DFT methods.

NFFT (12Nlog 2 2N+8N) Direct Convolution (N 2 ) ,5601, ,8884, ,31216, ,69665, ,2964,194,304 Number of operations needed to perform convolution of two N-point sequences