ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals.

Slides:



Advertisements
Similar presentations
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
Advertisements

ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Periodograms Bartlett Windows Data Windowing Blackman-Tukey Resources:
The Discrete Fourier Transform. The spectrum of a sampled function is given by where –  or 0 .
Ch.4 Fourier Analysis of Discrete-Time Signals
Familiar Properties of Linear Transforms
Lecture 5: Linear Systems and Convolution
PROPERTIES OF FOURIER REPRESENTATIONS
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.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Signals and Systems Discrete Time Fourier Series.
Systems: Definition Filter
Discrete-Time Fourier Series
… Representation of a CT Signal Using Impulse Functions
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)
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Stability and the s-Plane Stability of an RC Circuit 1 st and 2 nd.
Properties of the z-Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Useful Building Blocks Time-Shifting of Signals Derivatives Sampling (Introduction)
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Introduction to the IEEE Derivation of the DFT Relationship to DTFT DFT of Truncated.
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]
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Derivation Transform Pairs Response of LTI Systems Transforms of Periodic Signals.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Review Resources: Wiki: Superheterodyne Receivers RE: Superheterodyne.
Discrete Fourier Transform Prof. Siripong Potisuk.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Modulation Summation Convolution Initial Value and Final Value Theorems Inverse.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Convolution Definition Graphical Convolution Examples Properties.
Interconnections Blocks can be thought of as subsystems that make up a system described by a signal flow graph. We can reduce such graphs to a transfer.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: The Trigonometric Fourier Series Pulse Train Example Symmetry (Even and Odd Functions)
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Definitions Random Signal Analysis (Review) Discrete Random Signals Random.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Fourier Analysis of Discrete-Time Systems
Representation of CT Signals (Review)
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
Digital Signal Processing
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Periodic Signals Triangle Wave Other Simple Functions Review Integration.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Demultiplexing and Demodulation Superheterodyne Receivers Review Resources: Wiki:
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Causality Linearity Time Invariance Temporal Models Response to Periodic.
The Trigonometric Fourier Series Representations
Motivation for the Laplace Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Eigenfunctions Fourier Series of CT Signals Trigonometric Fourier.
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Frequency Response Response of a Sinusoid DT MA Filter Filter Design DT WMA Filter.
Linear Constant-Coefficient Difference Equations
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: FIR Filters Design of Ideal Lowpass Filters Filter Design Example.
The Discrete Fourier Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Difference Equations Transfer Functions Block Diagrams Resources:
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Eigenfunctions Fourier Series of CT Signals Trigonometric Fourier Series Dirichlet.
The Trigonometric Fourier Series Representations
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
EE104: Lecture 6 Outline Announcements: HW 1 due today, HW 2 posted Review of Last Lecture Additional comments on Fourier transforms Review of time window.
DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing.
Hülya Yalçın ©1 Fourier Series. Hülya Yalçın ©2 3.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Chapter 4 Discrete-Time Signals and transform
Linear Constant-Coefficient Difference Equations
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Digital Signal Processing Lecture 4 DTFT
8 DIGITAL SIGNAL SPECTRA
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Lecture 17 DFT: Discrete Fourier Transform
LECTURE 18: FAST FOURIER TRANSFORM
LECTURE 18: FOURIER ANALYSIS OF CT SYSTEMS
Signals and Systems EE235 Lecture 23 Leo Lam ©
LECTURE 05: CONVOLUTION OF DISCRETE-TIME SIGNALS
LECTURE 07: CONVOLUTION FOR CT SYSTEMS
Signals and Systems Lecture 15
LECTURE 20: FOURIER ANALYSIS OF DT SYSTEMS
LECTURE 11: FOURIER TRANSFORM PROPERTIES
LECTURE 18: FAST FOURIER TRANSFORM
Presentation transcript:

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Derivation of the DFT Relationship to DTFT DFT of Truncated Signals Time Domain Windowing Resources: Wiki: Discrete Fourier Transform Wolfram: Discrete Fourier Transform DSPG: The Discrete Fourier Transform Wiki: Time Domain Windows ISIP: Java Applet Wiki: Discrete Fourier Transform Wolfram: Discrete Fourier Transform DSPG: The Discrete Fourier Transform Wiki: Time Domain Windows ISIP: Java Applet LECTURE 17: DISCRETE FOURIER TRANSFORM URL:

EE 3512: Lecture 17, Slide 1 The Discrete-Time Fourier Transform: Not practical for (real-time) computation on a digital computer. Solution: limit the extent of the summation to N points and evaluate the continuous function of frequency at N equispaced points: MATLAB code for the DFT: The exponentials can be precomputed so that the DFT can be computed as a vector-matrix multiplication. Later we will exploit the symmetry properties of the exponential to speed up the computation (e.g., fft()). The Discrete-Time Fourier Transform

EE 3512: Lecture 17, Slide 2 Computation of the DFT Given the signal:

EE 3512: Lecture 17, Slide 3 Symmetry The magnitude and phase functions are even and odd respectively. The DFT also has “circular” symmetry: When N is even, |X k | is symmetric about N/2. The phase,  X k, has odd symmetry about N/2.

EE 3512: Lecture 17, Slide 4 Inverse DFT The inverse transform follows from the DT Fourier Series:

EE 3512: Lecture 17, Slide 5 Computation of the Inverse DFT

EE 3512: Lecture 17, Slide 6 Relationship to the DTFT The DFT and the DFT are related by: If we define a pulse as: The DFT is simply a sampling of the DTFT at equispaced points along the frequency axis. As N increases, the sampling becomes finer. Note that this is true even when q is constant  increasing N is a way of interpolating the spectrum. q=5, N = 22 q = 5, N = 88 q = 5

EE 3512: Lecture 17, Slide 7 DFT of Truncated Signals What if the signal is not time-limited? We can think of limiting the sum to N points as a truncation of the signal: What are the implications of this in the frequency domain? (Hint: convolution) Popular Windows:  Rectangular:  Generalized Hanning:  Triangular: Rectangular Generalized Hanning Triangular

EE 3512: Lecture 17, Slide 8 Impact on Spectral Estimation The spectrum of a windowed sinewave is the convolution of two impulse functions with the frequency response of the window. For two closely spaced sinewaves, there is “leakage” between each sinewave’s spectrum. The impact of this leakage can be mitigated by using a window function with a narrower main lobe. For example, consider the spectrum of three sinewaves computed using a rectangular and a Hamming window. We see that for the same number of points, the spectrum produced by te Hamming window separates the sinewaves. What is the computational cost?

EE 3512: Lecture 17, Slide 9 Summary Introduced the Discrete Fourier Transform as a truncated version of the Discrete-Time Fourier Transform. Demonstrated both the forward and inverse transforms. Explored the relationship to the DTFT. Compared the spectrum of a pulse. Discussed the effects of truncation on the spectrum. Introduced the concept of time domain windowing and discussed the impact of windows in the frequency domain.