Lecture 17 Outline: DFT Properties and Circular Convolution

Slides:

Advertisements

Similar presentations

DFT & FFT Computation.

Advertisements

DFT properties Note: it is important to ensure that the DFTs are the same length If x1(n) and x2(n) have different lengths, the shorter sequence must be.

Chapter 8: The Discrete Fourier Transform

MSP15 The Fourier Transform (cont’) Lim, MSP16 The Fourier Series Expansion Suppose g(t) is a transient function that is zero outside the interval.

Chapter 12 Fourier Transforms of Discrete Signals.

A-A+ B-B+ C-C+ F. Week 11. Chapter 10 Fourier Transforms 1.The Four Fourier transforms CTFT DTFT FS DFT/S 2.Relationships 3.Important properties.

Math for CSLecture 11 Mathematical Methods for Computer Science Lecture 1.

Signals and Systems Discrete Time Fourier Series.

Prepared by: Deepak Kumar Rout

The Discrete Fourier Series

EE359 – Lecture 12 Outline Announcements Midterm announcements No HW next week (practice MTs) Maximal Ratio Combining MGF Approach to MRC Performance Equal.

Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.

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.

(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.

Digital Signal Processing – Chapter 10

Chapter 7: The Fourier Transform 7.1 Introduction

1 © 2010 Cengage Learning Engineering. All Rights Reserved. 1 Introduction to Digital Image Processing with MATLAB ® Asia Edition McAndrew ‧ Wang ‧ Tseng.

The Discrete Fourier Transform 主講人：虞台文. Content Introduction Representation of Periodic Sequences – DFS (Discrete Fourier Series) Properties of DFS The.

Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.

Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.

Hossein Sameti Department of Computer Engineering Sharif University of Technology.

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.

Lecture 17: The Discrete Fourier Series Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan

Lecture 6: DFT XILIANG LUO 2014/10. Periodic Sequence  Discrete Fourier Series For a sequence with period N, we only need N DFS coefs.

Chapter 5 Finite-Length Discrete Transform

Dan Ellis 1 ELEN E4810: Digital Signal Processing Topic 3: Fourier domain 1.The Fourier domain 2.Discrete-Time Fourier Transform (DTFT) 3.Discrete.

CS654: Digital Image Analysis

Linear filtering based on the DFT

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.

EE359 – Lecture 19 Outline Announcements Final Exam Announcements HW 8 (last HW) due Thursday 5pm (no late HWs) 10 bonus points for course evaluations.

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

EE359 – Lecture 11 Outline Announcements Class project links posted (please check). Will have comments back this week. Midterm announcements No HW next.

1 Circular or periodic convolution (what we usually DON’T want! But be careful, in case we do want it!) Remembering that convolution in the TD is multiplication.

بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman

Lecture 2 Outline “Fun” with Fourier Announcements: Poll for discussion section and OHs: please respond First HW posted 5pm tonight Duality Relationships.

Lecture 18: The Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan

Lecture 20 Outline: Laplace Transforms Announcements: Reading: “6: The Laplace Transform” pp. 1-9 HW 7 posted, due next Wednesday My OHs Monday cancelled,

Dr. Michael Nasief Digital Signal Processing Lec 7 1.

Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.

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.

بسم الله الرحمن الرحيم Lecture (12) Dr. Iman Abuel Maaly The Discrete Fourier Transform Dr. Iman Abuel Maaly University of Khartoum Department of Electrical.

الفريق الأكاديمي لجنة الهندسة الكهربائية 1 Discrete Fourier Series Given a periodic sequence with period N so that The Fourier series representation can.

Lecture 26 Outline: Z Transforms Announcements: Reading: “8: z-transforms” pp (no inverse or unilateral z transforms) HW 9 posted, due 6/3 midnight.

Lecture 16 Outline: Discrete Fourier Series and Transforms Announcements: Reading: “5: The Discrete Fourier Transform” pp HW 5 posted, short HW (2.

Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.

Lecture 27 Outline: Systems Analysis w/ Z Transforms, Course Review

Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT

Lecture 23 Outline: Laplace Examples, Inverse, Rational Form

DIGITAL SIGNAL PROCESSING ELECTRONICS

Digital Signal Processing Lecture 4 DTFT

EE359 – Lecture 12 Outline Maximal Ratio Combining

EE359 – Lecture 11 Outline Announcements

The Discrete Fourier Transform

EE359 – Lecture 12 Outline Announcements Transmit Diversity

Lecture 14 Outline: Discrete Fourier Series and Transforms

Chapter 8 The Discrete Fourier Transform

Sampling the Fourier Transform

Lecture 18 DFS: Discrete Fourier Series, and Windowing

Lecture 17 DFT: Discrete Fourier Transform

Lecture 15 Outline: DFT Properties and Circular Convolution

Lecture 16 Outline: Linear Convolution, Block-by Block Convolution, FFT/IFFT Announcements: HW 4 posted, due tomorrow at 4:30pm. No late HWs as solutions.

EE359 – Lecture 11 Outline Introduction to Diversity

Lecture 25 Outline: Z Transforms, Discrete-time Systems Analysis

Chapter 8 The Discrete Fourier Transform

Chapter 8 The Discrete Fourier Transform

CE Digital Signal Processing Fall Discrete Fourier Transform (DFT)

Presentation transcript:

Lecture 17 Outline: DFT Properties and Circular Convolution Announcements: Reading: “5: The Discrete Fourier Transform” pp. 7-11. HW 5 posted, short HW (2 analytical and 1 Matlab problem), due today 5pm. No late HWs as solutions will be available immediately. Midterm details on next page HW 6 will be posted Wed, due following Wed with free extension to Thurs. Properties of the DFT Circular time and frequency shift Circular Convolution Multiplication Circular Convolution Methods Linear vs. Circular Convolution

Midterm Details Time/Location: this Friday, May 6, 9:20am-11:20am in this room. Students with class or exam conflicts have been contacted about logistics to start exam at 10:30 (go to room 200-203 - two floors up) Open book and notes – you can bring any written material you wish to the exam. Calculators and electronic devices not allowed. Will cover all class material from Lectures 1-14. See lecture ppt slides for material in the reader that you are responsible for Practice MT posted, worth 25 extra credit points for “taking” it Not graded. Can be turned in any time up until you take the exam Solutions given when you “turn in” your answers (photo, email, hardcopy, etc.) Have also posted additional practice problems and solutions Instead of MT review, we will provide extra OHs (see calendar): My extra OHs: Wed 2-3:30pm, Thurs 3-4:30pm. TA extra OHs: Tues 3-5pm, Wed 2-3pm, 5-6pm, Thur: 10:30-11:30am, 1:30-2:30pm, 5-6pm, 8-9pm. All in 3rd floor Packard kitchen area.

Review of Last Lecture Discrete Fourier Series (DFS) Pair for Periodic Signals Discrete Fourier Transform (DFT) Pair and are one period of and , respectively DFT is DTFT sampled at N equally spaced frequencies between 0 and 2p: The DFT and IDFT can be computed as matrix multiplications where matrix elements are different powers of

Properties of the DFS/DFT

Properties (Continued)

Circular Time/Frequency Shift Circular Time Shift (proved by DFS property of ) Circular Frequency Shift (IDFS property of )

Circular Convolution Defined for two N-length sequences as Circular convolution in time is multiplication in frequency Duality

Computing Circular Convolution; Circular vs. Linear Convolution Linearly convolve and Place sequences on circle in opposite directions, sum up all pairs, rotate outer sequence clockwise each time increment Circular versus Linear Convolution x1[n] * x2[n] Can obtain a linear convolution from a circular one by zero padding both sequences

Main Points DFS/DFT have similar properties as DTFS/DTFT but with modifications due to periodic/circular characteristics A circular time shift leads to multiplication in frequency by a complex phase term A circular frequency shift leads to a complex phase term multiplication with the original sequence (modulation) Circular convolution in time leads to multiplication of DFTs Circular convolution can be computed based on linear convolution of periodized sequences or circle method