Discrete Fourier Transform Prof. Siripong Potisuk.

Slides:



Advertisements
Similar presentations
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Advertisements

Ch.4 Fourier Analysis of Discrete-Time Signals
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
Chapter 8: The Discrete Fourier Transform
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
Chapter 12 Fourier Transforms of Discrete Signals.
APPLICATIONS OF FOURIER REPRESENTATIONS TO
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Discrete-Time Fourier Methods
Signals and Systems Discrete Time Fourier Series.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Discrete-Time Fourier Series
FT Representation of DT Signals:
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Fourier representation for discrete-time signals And Sampling Theorem
Discrete-Time and System (A Review)
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
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.
CHAPTER 3 Discrete-Time Signals in the Transform-Domain
Motivation Music as a combination of sounds at different frequencies
Fourier Series Summary (From Salivahanan et al, 2002)
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
Fourier To apprise the intimate relationship between the 4-Fourier’s used in practice. Continuous Time Fourier Series and Continuous Time Fourier Transform.
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.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
Digital Signal Processing – Chapter 10
Finite-Length Discrete Transform
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Hasliza A Samsuddin EKT.
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.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 EKT 232.
Digital Signal Processing Chapter 3 Discrete transforms.
Fourier Analysis of Discrete Time Signals
Digital Signal Processing
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Chapter 5 Finite-Length Discrete Transform
Fourier Analysis of Signals and Systems
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.
Fourier Representation of Signals and LTI Systems.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 UniMAP.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
Lecture 2 Outline “Fun” with Fourier Announcements: Poll for discussion section and OHs: please respond First HW posted 5pm tonight Duality Relationships.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 3 Review of Discerete time Fourier Transform (DTFT) University of Khartoum Department of Electrical.
Lecture 18: The Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
بسم الله الرحمن الرحيم Lecture (12) Dr. Iman Abuel Maaly The Discrete Fourier Transform Dr. Iman Abuel Maaly University of Khartoum Department of Electrical.
DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing.
DIGITAL SIGNAL PROCESSING ELECTRONICS
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
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.
MMSE Optimal Design: The Least Squares method
Chapter 8 The Discrete Fourier Transform
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Lecture 17 DFT: Discrete Fourier Transform
Lecture 15 DTFT: Discrete-Time Fourier Transform
Chapter 2 Discrete Fourier Transform (DFT)
copyright Robert J. Marks II
Signals and Systems Lecture 15
Lec.6:Discrete Fourier Transform and Signal Spectrum
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Electrical Communications Systems ECE
Presentation transcript:

Discrete Fourier Transform Prof. Siripong Potisuk

Summary of Spectral Representations Signal type TransformFrequency Domain CT, Periodic Continuous-time Fourier Series (CTFS) Discrete Spectrum CT, Aperiodic Continuous-time Fourier Transform (CTFT) Continuous Spectrum DT, Aperiodic Discrete-time Fourier Transform (DTFT) Continuous Spectrum, periodic DT, Periodic Discrete-time Fourier Series (DTFS) Discrete Fourier Transform (DFT) Discrete Spectrum, periodic

Computation of DTFT Computer implementation can be accomplished by: 1.Truncate the summation so that it ranges over finite limits  x[n] is a finite-length sequence. 2.Discretize  to  k  evaluate DTFT at a finite number of discrete frequencies For an N-point sequence, only N values of frequency samples of X(e j  ) at N distinct frequency points, are sufficient to determine x[n] and X(e j  ) uniquely.

Sequence Truncation

Uniform Frequency Sampling Re(z) Im(z) z0z0 z1z1 z2z2 z3z3 z4z4 z5z5 z6z6 z7z7 1 N = 8

Discrete Fourier Transform Let x[n] be an N-point signal, and W N be the N th root of unity. The N-point discrete Fourier Transform of x[n], denoted X(k) = DFT{x[n]}, is defined as

Inverse Discrete Fourier Transform Let X(k) be an N-point DFT sequence, and W N be the N th root of unity. The N-point inverse discrete Fourier Transform of X(k), denoted x[n] = IDFT{X(k)}, is defined as

N th Root of Unity

Matrix Formulation

Example 4.2 Define a sequence x[n] = 1, 2, 3, 4 when n = 0, 1, 2, 3, respectively. Evaluate its DFT, X(k).

Example 4.3 Using the result from example 4.2, evaluate the IDFT to obtain the time-domain sequence, x(n).

DFT Computation Using MATLAB fft(x) - Computes the N-point DFT of a vector x of length N fft(x, M) - Computes the M-point DFT of a vector x of length N If N < M, x is zero-padded at the end to make it into a vector of length M If N > M, x is truncated to the first M samples ifft(X) - Computes the N-point IDFT of a vector X of length N ifft(X, M) - Computes the M-point IDFT of a vector X of length N If N < M, X is zero-padded at the end to make it into a vector of length M If N > M, X is truncated to the first M samples

DFT Interpretation DFT sample X(k) specifies the magnitude and phase angle of the k th spectral component of x[n]. The amount of power that x[n] contains at a normalized frequency, f k, can be determined from the power density spectrum defined as

Example 4.3 Consider the sequence given below. Compute and sketch the magnitude, phase, and power density spectra.