Discrete Fourier transform (DFT)
|
|
- Joy Townsend
- 6 years ago
- Views:
Transcription
1 Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34
2 Periodic signals Consider a periodic signal x[n] with period ( x[n + r] = x[n] for r Z) This signal is completely determined by samples according to x[n] = 1 m=0 x[m] p [n m] p [n] = + r= δ[n r] is a train of impulses spaced by samples Example (Discrete pulse train) The discrete impulse train p [n] is shown below for = 4 0 n Signal Processing LEA (IST) Discrete Fourier transform 2 / 34
3 Periodic signals Theorem (Harmonic representation of a discrete impulse train) The discrete impulse train p [n] can be represented as Proof 1 1 k=0 But W n Hence p [n] = 1 W kn = 1 1 k=0 1 k=0 W kn, with W = e j 2π ( W n = e j 2π (n) = 1 and W n 1 1 W kn = k=0 ) k = + r= 1 1 W n 1 W n,if W n 1 1,if W n = 1 = ej 2π n = 1 n = r (r Z). δ[n r] = p [n] Signal Processing LEA (IST) Discrete Fourier transform 3 / 34
4 Periodic signals Using this representation for p [n] in the expression of x[n] on page 2: x[n] = 1 m=0 = 1 x[m] p [n m] = 1 1 k=0 m=0 x[m]w km } {{ } X[k] 1 m=0 W kn x[m] ( 1 1 k=0 W k(n m) ) Remark Signal X[k] is also periodic, with period Signal Processing LEA (IST) Discrete Fourier transform 4 / 34
5 Discrete Fourier series (DFS) Definition (Discrete Fourier series (DFS)) Given a periodic sequence x[n] (n Z), the DFS associates it with another sequence X[k] (k Z) having the same period X[k] = 1 n=0 x[n] = 1 x[n]w kn 1 k=0 X[k]W kn [Analysis] [Synthesis] otation: x[n] DFS X[k], X[k] = DFS { x[n]}, x[n] = DFS 1 { X[k] } Signal Processing LEA (IST) Discrete Fourier transform 5 / 34
6 Interpretation of the DFS Remark (Interpretation of the DFS) [Synthesis] x[n] is a finite linear superposition of complex exponentials [Analysis] X[k] measures the importance of frequency ω k = k 2π (k = 0,1,..., 1) in x[n] Signal Processing LEA (IST) Discrete Fourier transform 6 / 34
7 Properties of the DFS Linearity: α 1 x 1 [n] + α 2 x 2 [n] DFS α 1 X1 [k] + α 2 X2 [k], α 1,α 2 C Time shift: Frequency shift: x[n n 0 ] DFS W kn 0 X[k], n 0 Z W k 0n x[n] DFS X[k k 0 ], k 0 Z Duality: X[n] DFS x[ k] Signal Processing LEA (IST) Discrete Fourier transform 7 / 34
8 Properties of the DFS Periodic convolution: 1 m=0 h[m] x[n m] }{{} ( x h)[n] DFS X[k] H[k], x, h : period Multiplication in time: x[n] h[n] DFS 1 1 l=0 }{{} 1 ( X H)[k] H[l] X[k l], x, h : period Signal Processing LEA (IST) Discrete Fourier transform 8 / 34
9 Relation between the DFS and FT: Periodic signals Question For a signal x[n] with period, how is its Fourier transform X(e jω ) related to the DFS X[k]? Intuitively, both should contain the same information a spectral representation of x[n] Signal Processing LEA (IST) Discrete Fourier transform 9 / 34
10 Relation between the DFS and FT: Periodic signals From x[n] = 1 m=0 x[m] p [n m] the FT X(e jω ) is given by X(e jω ) = = 1 m=0 1 m=0 = 2π = 2π x[m]e jωm P (e jω ) x[m]e jωm ( 2π 1 m=0 + x[m] 1 k= m=0 + k= + k= ( δ ω k 2π ) ) ( e jωm δ ω k 2π ) }{{} x[m]w km } {{ } X[k] e j 2π km δ(ω k 2π ) δ ( ω k 2π ) Signal Processing LEA (IST) Discrete Fourier transform 10 / 34
11 Relation between the DFS and FT: Periodic signals Conclusion Up to a factor 2π the DFS coefficients coincide with the magnitudes of Dirac impulses, evenly-spaced by 2π, that modulate the FT X(e jω ) Example X(e jω ) for = 3 2π 3 X[ 1] 2π 3 X[0] 2π 3 X[1] 2π 3 X[2] 2π 3 X[3] 2π 3 X[4] 0 2π 3 ω Signal Processing LEA (IST) Discrete Fourier transform 11 / 34
12 Relation between the DFS and FT: Finite-duration signals Consider a signal x[n] with length (x[n] = 0 outside the interval 0 n 1) Build its periodic extension x[n] = (x p )[n] = + r= x[n r] Example for = 3 x[n] x[n] 0 n 0 n Question How is the FT X(e jω ) related to the DFS X[k]? Signal Processing LEA (IST) Discrete Fourier transform 12 / 34
13 Relation between the DFS and FT: Finite-duration signals From x[n] = (x p )[n] the FT X(e jω ) is given by X(e jω ) = X(e jω ) P (e jω ) = X(e jω ) = 2π = 2π + k= + k= ( 2π ( X(e jω )δ ω k 2π X ) + k= ( ) ( e jk 2π δ ω k 2π ) ( δ ω k 2π ) ) Comparing with the representation of X(e jω ) on page 10 yields ( ) X[k] = X e jk 2π Signal Processing LEA (IST) Discrete Fourier transform 13 / 34
14 Relation between the DFS and FT: Finite-duration signals Conclusion The DFS coefficients X[k] of the periodic extension of x[n] are samples of the TF X(e jω ) taken along the unit circle and equispaced by 2π rad Example for = 8 k =..., 5,3,11,... k =..., 4,4,12,... k =..., 6,2,10,... 2π k =..., 7,1,9,... k =..., 8,0,8,... k =..., 3,5,13,... k =..., 1,7,15,... k =..., 2,6,14,... Signal Processing LEA (IST) Discrete Fourier transform 14 / 34
15 Relation between the DFS and FT: Arbitrary signals Consider an arbitrary signal x[n] with FT X(e jω ) Build the periodic signal, with period, ( ) X[k] = X e jk 2π, k Z Question { X[k] } How is x[n] = DFS 1 related to x[n]? Remark We know the answer if the duration of x[n] is smaller than : x[n] is the periodic extension of x[n] Signal Processing LEA (IST) Discrete Fourier transform 15 / 34
16 Relation between the DFS and FT: Arbitrary signals Computing x[n]: x[n] = 1 = 1 (p. 3) = 1 k=0 1 k=0 + m= X[k]W kn ( + = (x p )[n] = + r= m= x[m] x[n r] = 1 1 k=0 X x[m]e jk 2π m ) 1 1 W k(n m) k=0 }{{} p [n m] ( ) e jk 2π W kn W kn Signal Processing LEA (IST) Discrete Fourier transform 16 / 34
17 Relation between the DFS and FT: Arbitrary signals Conclusion x[n] is a sum of replicas of x[n], spaced by samples Corollary (Regeneration of signals) If x[n] has finite duration, then it can be recovered from x[n] (take one period) If x[n] has duration > then there is aliasing in the time domain and in general it cannot be recovered from x[n] If x[n] has finite duration, aliasing can be avoided by choosing sufficiently large Essentially, this is a sampling theorem in the frequency domain Signal Processing LEA (IST) Discrete Fourier transform 17 / 34
18 Discrete Fourier transform (DFT) Definition (Discrete Fourier transform (DFT)) Given a finite-duration signal x[n] (n = 0,1,..., 1), the DFT associates it with the finite-duration sequence X[k] (k = 0, 1,..., 1) X[k] = 1 n=0 x[n] = 1 x[n]w kn 1 k=0 X[k]W kn [Analysis] [Synthesis] otation: x[n] DFT X[k], X[k] = DFT {x[n]}, x[n] = DFT 1 {X[k]} Signal Processing LEA (IST) Discrete Fourier transform 18 / 34
19 Interpretation of the DFT Remark (Interpretation of the DFT) [Synthesis] x[n] is a finite linear superposition of complex exponentials with finite duration [Analysis] X[k] measures the importance of frequency ω k = k 2π (k = 0,1,..., 1) in x[n] Signal Processing LEA (IST) Discrete Fourier transform 19 / 34
20 Relation between the DFT and DFS Consider a signal x[n] with finite duration and its periodic extension x[n] = (x p )[n] x[n] can also be represented as x[n] = x[ n ] otation: n = n mod Examples: 3 3 = 0, 2 3 = 1, 1 3 = 2, 1 3 = 1, 3 3 = 0, 4 3 = 1 Relation between the DFT and DFS x[n] DFT X[k] truncate 1 period truncate 1 period x[n] periodical extension DFS X[k] periodical extension Signal Processing LEA (IST) Discrete Fourier transform 20 / 34
21 Properties of the DFT Remark Below, denotes the DFT length is not smaller than the original signal length (typically equal) Linearity: Circular shift: α 1 x 1 [n] + α 2 x 2 [n] DFT α 1 X 1 [k] + α 2 X 2 [k], α 1,α 2 C, max{length x 1, length x 2 } x[ n n 0 ] DFT W kn 0 X[k], n 0 Z Signal Processing LEA (IST) Discrete Fourier transform 21 / 34
22 Properties of the DFT Example (Circular shift for = 4) x[n] x[ n 1 4 ] n 0 0 n x[ n 2 4 ] x[ n ] 0 n 0 n Signal Processing LEA (IST) Discrete Fourier transform 22 / 34
23 Properties of the DFT Frequency shift: W k 0n x[n] DFT X[ k k 0 ], k 0 Z Duality: X[n] DFT x[ k ] Signal Processing LEA (IST) Discrete Fourier transform 23 / 34
24 Properties of the DFT Circular convolution: 1 m=0 Multiplication in time: h[m]x[ n m ] } {{ } (x h)[n] DFT X[k]H[k] x[n]h[n] DFT 1 1 H[l]X[ k l ] l=0 }{{} 1 (X H)[k] Signal Processing LEA (IST) Discrete Fourier transform 24 / 34
25 Relation between the DFT and FT: Finite-duration signals Consider a signal x[n] with length (x[n] = 0 outside the interval 0 n 1) Question How is the FT X(e jω ) related to the DFT X[k]? We have: Conclusion X[k] = 1 n=0 x[n]w kn = + = X(e jω ) ω=k 2π n= x[n]w kn = + n= x[n]e jk 2π n The DFT coefficients X[k] are samples of the TF X(e jω ) taken along the unit circle and equispaced by 2π rad Signal Processing LEA (IST) Discrete Fourier transform 25 / 34
26 Relation between the DFT and FT: Arbitrary signals Consider an arbitrary signal x[n] with FT X(e jω ) Define a finite duration signal x [n] from the set of DFT coefficients X [k] = X(e jω ) ω=k 2π, k = 0,1,..., 1 Question How is x [n] = DFT 1 {X [k]} related to x[n]? Remark We know the answer if x[n] is a finite duration signal whose length does not exceed (hence x [n] = x[n]) Signal Processing LEA (IST) Discrete Fourier transform 26 / 34
27 Relation between the DFT and FT: Arbitrary signals Using the diagram of page 20 and the result of page 17 x [n] = + r= x[n r], n = 0,1,..., 1 Conclusion x [n] is a sum of replicas of x[n], spaced by samples, and restricted to the time interval n = 0,1,..., 1 Signal Processing LEA (IST) Discrete Fourier transform 27 / 34
28 Linear and circular convolution 1 Consider finite-duration signals x[n] with length L and h[n] with length P 2 Let y[n] = (x h)[n] be their linear convolution, which has length L + P 1 3 ow choose max{p,l} and define the circular convolution y [n] = (x h)[n] Question How is y [n] related to y[n]? Motivation Very efficient algorithms are available (FFT) for computing y [n] Signal Processing LEA (IST) Discrete Fourier transform 28 / 34
29 Linear and circular convolution ote that Y [k] = DFT {y [n]} = X[k]H[k] = X(e jω )H(e jω ) ω=k 2π Using the result of page 27 we have = Y (e jω ) ω= y [n] = DFT 1 {Y [k]} = Conclusion (Important!) If L + P 1 then + r= y[n r] (x h)[n] = (x h)[n] for n = 0,1,..., 1 If = L P then (x h)[n] = (x h)[n] for n = P,P + 1,..., 1 Signal Processing LEA (IST) Discrete Fourier transform 29 / 34
30 Conclusion (Linear convolution from circular convolution) Choosing P + L 1 the linear convolution y[n] = (x h)[n] can be computed as follows: 1 Compute the -point DFT of x[n]: X[k] = DFT {x[n]} 2 Compute the -point DFT of h[n]: H[k] = DFT {h[n]} 3 Multiply in the frequency domain: Y [k] = X[k]H[k], k = 0,1,..., 1 4 Invert the DFT: y[n] = DFT 1 {Y [k]}, n = 0,1,..., 1 Remark Very efficient algorithms are available for computing DFT { } and DFT 1 { } When L P (or L = + ) use time-recursive versions of the above procedure: overlap-add and overlap-save Signal Processing LEA (IST) Discrete Fourier transform 30 / 34
31 Overlap-add In the overlap-add method x[n] is viewed as a concatenation of disjoint blocks x[n] = L/M 1 r=0 x r [n rm] where x r [n] denotes the signal in one of the blocks (of size M) Compute each convolution y r [n] = (x r h)[n] by the method of page 30 Combine the partial results to get y[n] = (x h)[n] = L/M 1 r=0 y r [n rm] Signal Processing LEA (IST) Discrete Fourier transform 31 / 34
32 Overlap-add Example (Overlap-add) h[n] has length P = 3 and x[n] has length L = 18 The block size is chosen as M = 6 h[0] = 1, h[1] = 1, h[2] = 1 The DFT size must satisfy M + P 1 = 8. It is chosen as = 8 in this example Signal Processing LEA (IST) Discrete Fourier transform 32 / 34
33 Overlap-add Example (Overlap-add (cont.)) 3 x[n] 3 x 0 [n] x 1 [n] x 2 [n] Signal Processing LEA (IST) Discrete Fourier transform 33 / 34
34 Overlap-add Example (Overlap-add (cont.)) y 0 [n] y 1 [n M] y 2 [n 2M] y[n] Signal Processing LEA (IST) Discrete Fourier transform 34 / 34
Lecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
More informationECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are
ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More informationDiscrete-time Signals and Systems in
Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The
More informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 22: April 10, 2018 Adaptive Filters Penn ESE 531 Spring 2018 Khanna Lecture Outline! Circular convolution as linear convolution with aliasing! Adaptive Filters Penn
More informationComplex symmetry Signals and Systems Fall 2015
18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The
More informationDigital Signal Processing Chapter 10. Fourier Analysis of Discrete- Time Signals and Systems CHI. CES Engineering. Prof. Yasser Mostafa Kadah
Digital Signal Processing Chapter 10 Fourier Analysis of Discrete- Time Signals and Systems Prof. Yasser Mostafa Kadah CHI CES Engineering Discrete-Time Fourier Transform Sampled time domain signal has
More informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationOLA and FBS Duality Review
MUS421/EE367B Lecture 10A Review of OverLap-Add (OLA) and Filter-Bank Summation (FBS) Interpretations of Short-Time Fourier Analysis, Modification, and Resynthesis Julius O. Smith III (jos@ccrma.stanford.edu)
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More informationVII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.
1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n 2 Note that W N k = 0 but
More informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: April 11, 2012 Comments, questions or bug reports? Please contact verghese at mit.edu CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have
More informationDISCRETE FOURIER TRANSFORM
DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
More informationProperties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationCh.11 The Discrete-Time Fourier Transform (DTFT)
EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationconvenient means to determine response to a sum of clear evidence of signal properties that are obscured in the original signal
Digital Speech Processing Lecture 9 Short-Time Fourier Analysis Methods- Introduction 1 General Discrete-Time Model of Speech Production Voiced Speech: A V P(z)G(z)V(z)R(z) Unvoiced Speech: A N N(z)V(z)R(z)
More informationVU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/17s/
More information[ ], [ ] [ ] [ ] = [ ] [ ] [ ]{ [ 1] [ 2]
4. he discrete Fourier transform (DF). Application goal We study the discrete Fourier transform (DF) and its applications: spectral analysis and linear operations as convolution and correlation. We use
More informationVery useful for designing and analyzing signal processing systems
z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Prof. Mark Fowler Note Set #21 Using the DFT to Implement FIR Filters Reading Assignment: Sect. 7.3 of Proakis & Manolakis Motivation: DTFT View of Filtering There are
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations
More informationDefinition of Discrete-Time Fourier Transform (DTFT)
Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationFourier Analysis and Spectral Representation of Signals
MIT 6.02 DRAFT Lecture Notes Last update: November 3, 2012 CHAPTER 13 Fourier Analysis and Spectral Representation of Signals We have seen in the previous chapter that the action of an LTI system on a
More informationMAHALAKSHMI ENGINEERING COLLEGE-TRICHY
DIGITAL SIGNAL PROCESSING DEPT./SEM.: ECE&EEE /V DISCRETE FOURIER TRANFORM AND FFT PART-A 1. Define DFT of a discrete time sequence? AUC MAY 06 The DFT is used to convert a finite discrete time sequence
More informationChapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter
Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationDFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6
DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ
More informationSignals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk
Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω
More informationThe Z transform (2) 1
The Z transform (2) 1 Today Properties of the region of convergence (3.2) Read examples 3.7, 3.8 Announcements: ELEC 310 FINAL EXAM: April 14 2010, 14:00 pm ECS 123 Assignment 2 due tomorrow by 4:00 pm
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:
More informationHW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1
HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationOLA and FBS Duality Review
OLA and FBS Duality Review MUS421/EE367B Lecture 10A Review of OverLap-Add (OLA) and Filter-Bank Summation (FBS) Interpretations of Short-Time Fourier Analysis, Modification, and Resynthesis Julius O.
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationDigital Signal Processing
DIGITAL SIGNAL PROCESSING SUBJECT CODE : NO. OF LECTURE HRS/WEEK : 04 TOTAL NO. OF LECTURE HRS. : 52 IA MARKS : 25 EXAM HOURS : 03 EXAMMARKS : 100 UNIT - 1 DISCRETE FOURIER TRANSFORMS (DFT): FREQUENCY
More informationENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University
ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function
More informationEEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.
EEE400F EXAM DIGITAL SIGNAL PROCESSING PART A Basic digital signal processing theory.. A sequencex[n] has a zero-phase DTFT X(e jω ) given below: X(e jω ) University of Cape Town Department of Electrical
More informationDiscrete-Time David Johns and Ken Martin University of Toronto
Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn
More informationx[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e
More informationECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3
ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out
More informationSignals and Systems Spring 2004 Lecture #9
Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier
More informationLecture 7 January 26, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture 7 January 26, 26 Prof Emmanuel Candes Scribe: Carlos A Sing-Long, Edited by E Bates Outline Agenda:
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationSIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals
SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z
More informationModule 1: Signals & System
Module 1: Signals & System Lecture 6: Basic Signals in Detail Basic Signals in detail We now introduce formally some of the basic signals namely 1) The Unit Impulse function. 2) The Unit Step function
More informationFrequency-Domain C/S of LTI Systems
Frequency-Domain C/S of LTI Systems x(n) LTI y(n) LTI: Linear Time-Invariant system h(n), the impulse response of an LTI systems describes the time domain c/s. H(ω), the frequency response describes the
More informationECGR4124 Digital Signal Processing Midterm Spring 2010
ECGR4124 Digital Signal Processing Midterm Spring 2010 Name: LAST 4 DIGITS of Student Number: Do NOT begin until told to do so Make sure that you have all pages before starting Open book, 1 sheet front/back
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationDiscrete-Time Fourier Transform
C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationEE Homework 13 - Solutions
EE3054 - Homework 3 - Solutions. (a) The Laplace transform of e t u(t) is s+. The pole of the Laplace transform is at which lies in the left half plane. Hence, the Fourier transform is simply the Laplace
More informationBridge between continuous time and discrete time signals
6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems
More informationUniversity Question Paper Solution
Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=
More informationL6: Short-time Fourier analysis and synthesis
L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude
More information