HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1

Size: px
Start display at page:

Download "HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1"

Transcription

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) The z-transform C(z) = = =.5z +.5z =.5z +.5z.5z.5z +.5z.5 (.5z )(.5z).75z (z.5)(.5z) so there is a zero at and poles at.5 and. (c) C(e j ) =.75.5 = 3 To obtain the phase, consider that C(e jω ) is real and that its denominator.5 cos(ω) > since cos(ω) for ω [ π, π), thus the phase is zero.

2 Pr.. (a) The DTFT of x[n] = sin(.πn) = (e j.πn e j.πn )/j is X(e jω ) = π [δ(ω.π) δ(ω +.π)] j The period of x[n] is since the frequency is π/. The signal y[n] can be written y[n] = sin(.πn) (u[n] u[n ]) = w[n] sin(.πn)[n] = w[n] ej.πn e j.πn }{{} j w[n] so that by the frequency shifting property Y (e jω ) = j ( ) W(e j(ω.π) ) W(e j(ω+.π) ) i.e., the spectrum of the rectangular pulse shifted to ±.π. If instead of we use a very large value, Y (e jω ) would look similar to the DFT of x[n]. The following script computes and plots the DTFTs of y[n]. If you increase the value of q to a large value, e.g.,, the Y (e jω ) looks like X(e jω ) as many more values are used, that is the frequency resolution is larger. %% Pr. q=; N=*q; w=ones(,n); n=:n-;x=sin(.*pi*n); y=w.*x; M=5; Y=fft(y,M); omega=[:m-]**pi/m-pi; figure() subplot() plot(omega,fftshift(abs(y)));axis([min(omega) max(omega) 5]) ylabel( Y ) subplot() plot(omega,fftshift(unwrap(angle(y))));axis([min(omega) max(omega) -3 ]) ylabel( <Y );xlabel( \omega ) (b) The following script is used to compute and plot the window and the spectrum of the windowed signal clear all N=;n=-5:5; w=+cos(*pi*n/n); x=sin(.*pi*n); y=w.*x; M=5; Y=fft(y,M); omega=[:m-]**pi/m-pi; figure()

3 subplot(3) stem(n,w); axis([-5 5.*max(w)]);ylabel( w_[n] );xlabel( n ) subplot(3) plot(omega,fftshift(abs(y)));axis([min(omega) max(omega) 5]) ylabel( Y_ ) subplot(33) plot(omega,fftshift(unwrap(angle(y))));axis([min(omega) max(omega) -3 ]) ylabel( <Y_ );xlabel( \omega ) 5 w [n] Y n 3 3 Y 3 3 <Y ω <Y ω Figure.5: Magnitude and phase spectra of y[n] using a rectangular window (left). Raised cosine window and magnitude and phase spectra of y [n].

4 Pr..7 (a) When the signal is aperiodic, padding it with zeros increases the number of frequencies, i.e., increases the frequency resolution while the original amplitude values remain the same. %% Pr.7 clear all; clf x=ones(,); x=[x zeros(,)]; M=length(x); X=fft(x); x=[x zeros(,)]; M=length(x);X=fft(x,M); w=[:m-]**pi/m;n=:length(x)-; w=[:m-]**pi/m;n=:length(x)-; figure() subplot() stem(n,x); axis([ max(n).]);ylabel( x_[n] ) subplot() stem(n,x); axis([ max(n).]);ylabel( x_[n] ) subplot(3) stem(w,abs(x));axis([ *pi ]);ylabel( X_ ) subplot() stem(w,abs(x)); axis([ *pi ]) (b) When the signal is periodic, the fundamental frequencies do not change by considering several periods, zeros appear in between them. The amplitudes at the fundamental frequencies increases as the number of periods being considered increases. When padding zeros to a period, the signal is corrupted and its spectrum changes. % part (b) clear all N=; M=N; n=:m-; x=cos(pi*n/5); X=fft(x); w=[:m-]**pi/m; x=[x x x x x x x x x x]; M=*N;w=[:M-]**pi/M; X=fft(x) x3=[x zeros(,)]; X3=fft(x3); M=length(x3);w3=[:M-]**pi/M; figure() subplot(3) stem(w,abs(x));axis([ *pi 3.]);ylabel( X_ ) subplot(3) stem(w,abs(x));;axis([ *pi 3]);ylabel( X_ ) subplot(33) stem(w3,abs(x3));axis([ *pi 3.]);ylabel( X_3 ) xlabel( \omega (rad) )

5 x [n] X x [n] X X X X ω (rad) Figure.: Improving the frequency resolution of an aperiodic signal (left) and of a periodic signal.

6 Pr..8(a) The impulse response of the IIR filter appears to taper down around n = 3 so the approximation of the impulse response seems good. %% Pr.8 clear all;clf x=ones(,5); b=[.5 ]; a=[ ]; delta=[ zeros(,3)]; h=filter(b,a,delta); N=8; X=fft(x,N);H=fft(h,N); Y=X.*H; y=real(ifft(y)); figure() subplot(3) stem([x zeros(,)]) subplot(3) stem([h zeros(,)]) subplot(33) stem(y) (b)(c) In this case we do not truncate the impulse response, and the results y [n] are better than before y[n], (the control is the solution obtained using filter, y c [n]). % part X=fft(x,N);A=fft(a,N);B=fft(b,N); Y=X.*B./A; y=ifft(y); yc=filter(b,a,x); figure() subplot() plot(y) hold on plot(yc, r );grid hold off subplot() plot(y) hold on plot(yc, r ); grid hold off

7 x[n] h[n] y [n], y c [n] y[n] 3 8 n y [n],y c [n] 8 n Figure.:.

8 Pr..9(a)(b) Plotting x[m] and y[n m] (y[m] reversed and shifted to the right n samples), multiplying them and adding the overlapping values gives z[n] = (x y)[n], the linear convolution. See results of the script below. The values are also obtained by multiplying the z-transforms X(z) and Y (z) giving Z(z) = X(z)Y (z) = z + 3z + z 3 + 5z + 3z 5 which is the DTFT of z[n] when z = e jω (the coefficients of Z(z) coincide with the values from the linear convolution. (c) For N the circular convolution is graphically done as follows. The inner circle corresponds to x[m] and the outer circle to y[n m] (reversed and shifted clockwise), and at each shift the corresponding values are multiplied and added. The results are z[] = 5, z[] =, z[] =, z[3] = 3 and z[] =, which do not N =,,,,,, 3,,, z[] = 5 z[] = z[] = 3 z[3] =,,, Figure.: Circular convolution for N =. coincide with the values from the linear convolution, this is because N = < length[x[n]] + length[y[n]] =. For the other values of N, bigger than, a similar graphical procedure is used, but in these cases the results of the circular and the linear convolutions coincide. (d) If we let z = e jπk/n we obtain from the result in (a) that X(k)Y (k) = e j(πk/n) + 3e j(πk/n) + e j3(πk/n) + 5e j(πk/n) + 3e j5(πk/n) Now if N =, e j(πk/) = e j(πk/n) and e j5(πk/n) = e j(πk/n) so that the above can be written as X(k)Y (k) = 5 + ( + 3)e j(πk/n) + 3e j(πk/n) + e j3(πk/n) The coefficients of the DFT correspond to the values given by the circular convolution of length N =. If N = 7 > we have X(k)Y (k) = e j(πk/7) + 3e j(πk/7) + e j3(πk/7) + 5e j(πk/7) + 3e j5(πk/7) and its coefficients correspond to the circular convolution results with N = 7 and also coincide with the ones from the linear convolution. Likewise, for N = > we get X(k)Y (k) = e j(πk/) + 3e j(πk/) + e j3(πk/) + 5e j(πk/) + 3e j5(πk/)

9 In the cases when N > there is no simplification of the exponentials, as in the case for N <, and as such the circular and the linear convolutions coincide. The implementation using the fft function is shown below. clear all; clf x=[ 3 ]; y=[ ]; z=conv(x,y); % linear convolution n=:9; figure() subplot(3) stem(n,[x zeros(,)]);title( x[n] );grid subplot(3) stem(n,[y zeros(,)]);title( y[n] );grid subplot(33) stem(n,[z zeros(,3)]);title( z[n]=(x*y)[n] );grid % circular convolutions figure() for i=:3, if i==, N=;subplot(3) elseif i==, N=7;subplot(3) else N=;subplot(33) end X=fft(x,N); Y=fft(y,N); Z=X.*Y; z=ifft(z);m=length(z); stem(n,[z zeros(,-m)]) if i==, title( circular conv N= );grid elseif i==, title( circular conv N=7 );grid else title( circular conv N= );grid end end

10 3 x[n] circular conv N= y[n] z[n]=(x*y)[n] circular conv N= circular conv N= Figure.3: Linear convolution of x[n] and y[n] (left). Results of circular convolutions of x[n] and y[n] for lengths N = (right top), N = 7 and N = (right bottom).

Discrete Fourier Transform

Discrete 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 information

Fast 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 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 information

Fast 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 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 information

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

LAB 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 information

Lecture 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. 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 information

Discrete-Time Fourier Transform (DTFT)

Discrete-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 information

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Digital 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 information

7.16 Discrete Fourier Transform

7.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 information

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

! 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 information

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions 8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether

More information

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT Islamic University of Gaza Faculty of Engineering Electrical Engineering Department EG.MOHAMMED ELASMER Spring-22 DSP Laboratory (EELE 4) Lab#5 DTFS & DTFT Discrete-Time Fourier Series (DTFS) The discrete-time

More information

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing University of Illinois at Urbana-Champaign ECE 0: Digital Signal Processing Chandra Radhakrishnan PROBLEM SET : SOLUTIONS Peter Kairouz Problem. Hz z 7 z +/9, causal ROC z > contains the unit circle BIBO

More information

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2 Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be

More information

Frequency-Domain C/S of LTI Systems

Frequency-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 information

Discrete Time Systems

Discrete Time Systems Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about

More information

Digital Signal Processing: Signal Transforms

Digital Signal Processing: Signal Transforms Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab

More information

Discrete Fourier transform (DFT)

Discrete Fourier transform (DFT) Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with

More information

Discrete-time signals and systems

Discrete-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 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

/ (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 information

Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions

Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex

More information

Discrete Time Fourier Transform

Discrete 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 information

LABORATORY 1 DISCRETE-TIME SIGNALS

LABORATORY 1 DISCRETE-TIME SIGNALS LABORATORY DISCRETE-TIME SIGNALS.. Introduction A discrete-time signal is represented as a sequence of numbers, called samples. A sample value of a typical discrete-time signal or sequence is denoted as:

More information

ESE 531: Digital Signal Processing

ESE 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 information

Digital Signal Processing. Midterm 1 Solution

Digital 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 information

Discrete-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 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 information

Multimedia 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 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 information

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete 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 information

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set

More information

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d! Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship

More information

DISCRETE FOURIER TRANSFORM

DISCRETE 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 information

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation

Contents. 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 information

Digital Signal Processing Lab 3: Discrete Fourier Transform

Digital Signal Processing Lab 3: Discrete Fourier Transform Digital Signal Processing Lab 3: Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) The discrete-time Fourier transform (DTFT) of a sequence x[n] is given by (3.1) which is a continuous

More information

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

! 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 information

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Problem Set 9 Solutions EE23: Digital Signal Processing. From Figure below, we see that the DTFT of the windowed sequence approaches the actual DTFT as the window size increases. Gibb s phenomenon is absent

More information

Discrete Time Fourier Transform (DTFT)

Discrete 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 information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant

More information

Review of Fundamentals of Digital Signal Processing

Review of Fundamentals of Digital Signal Processing Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download

More information

OLA and FBS Duality Review

OLA 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 information

Digital 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 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 information

Review of Discrete-Time System

Review 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 information

Windowing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples

Windowing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples ing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples ing In practice, we cannot observe a signal x(n) for n = to n = Thus we must truncate, or window, the signal: x(n) w(n) ing

More information

Problem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:

Problem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum: EE 438 Homework 4. Corrections in Problems 2(a)(iii) and (iv) and Problem 3(c): Sunday, 9/9, 10pm. EW DUE DATE: Monday, Sept 17 at 5pm (you see, that suggestion box does work!) Problem 1. Suppose we calculate

More information

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters. INTRODUCTION 2. IIR FILTER DESIGN 3. ANALOG FILTERS 4. THE BUTTERWORTH ANALOG FILTER 5. THE CHEBYSHEV-I

More information

8 The Discrete Fourier Transform (DFT)

8 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

Chap 2. Discrete-Time Signals and Systems

Chap 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 information

Lecture 19: Discrete Fourier Series

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 information

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

SIGNALS 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 information

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB

More information

ELEN 4810 Midterm Exam

ELEN 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 information

OLA 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. Smith III (jos@ccrma.stanford.edu)

More information

ENT 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 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 information

Module 3. Convolution. Aim

Module 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 information

z-transform Chapter 6

z-transform Chapter 6 z-transform Chapter 6 Dr. Iyad djafar Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform

More information

EEL3135: Homework #4

EEL3135: Homework #4 EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]

More information

EE-210. Signals and Systems Homework 7 Solutions

EE-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 information

VII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.

VII. 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 information

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

Your solutions for time-domain waveforms should all be expressed as real-valued functions. ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.

More information

APPLIED SIGNAL PROCESSING

APPLIED SIGNAL PROCESSING APPLIED SIGNAL PROCESSING DIGITAL FILTERS Digital filters are discrete-time linear systems { x[n] } G { y[n] } Impulse response: y[n] = h[0]x[n] + h[1]x[n 1] + 2 DIGITAL FILTER TYPES FIR (Finite Impulse

More information

Lecture Notes on Fundamentals of Audio-Video Signal Processing

Lecture Notes on Fundamentals of Audio-Video Signal Processing Marco Tagliasacchi Lecture Notes on Fundamentals of Audio-Video Signal Processing November 12, 2007 Politecnico di Milano Contents Part I Fundamentals of Digital Signal Processing 1 Introduction to the

More information

LTI H. the system H when xn [ ] is the input.

LTI H. the system H when xn [ ] is the input. REVIEW OF 1D LTI SYSTEMS LTI xn [ ] y[ n] H Operator notation: y[ n] = H{ x[ n] } In English, this is read: yn [ ] is the output of the system H when xn [ ] is the input. 2 THE MOST IMPORTANT PROPERTIES

More information

Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A.

Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A. Discrete-Time Gaussian Fourier Transform Pair, and Generating a Random Process with Gaussian PDF and Power Spectrum Mark A. Richards October 3, 6 Updated April 5, Gaussian Transform Pair in Continuous

More information

Introduction to DSP Time Domain Representation of Signals and Systems

Introduction to DSP Time Domain Representation of Signals and Systems Introduction to DSP Time Domain Representation of Signals and Systems Dr. Waleed Al-Hanafy waleed alhanafy@yahoo.com Faculty of Electronic Engineering, Menoufia Univ., Egypt Digital Signal Processing (ECE407)

More information

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR

More information

Linear Convolution Using FFT

Linear 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 information

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

EE 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 information

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete

More information

Homework 3 Solutions

Homework 3 Solutions EECS Signals & Systems University of California, Berkeley: Fall 7 Ramchandran September, 7 Homework 3 Solutions (Send your grades to ee.gsi@gmail.com. Check the course website for details) Review Problem

More information

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n. Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 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 information

Very useful for designing and analyzing signal processing systems

Very 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 information

Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN

Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN Pusat Pengajian Kejuruteraan Komputer Dan Perhubungan Universiti Malaysia Perlis Discrete-Time

More information

Lecture 7 Discrete Systems

Lecture 7 Discrete Systems Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear

More information

EE 521: Instrumentation and Measurements

EE 521: Instrumentation and Measurements Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters

More information

CE 513: STATISTICAL METHODS

CE 513: STATISTICAL METHODS 28-8-217/CE 68 CE 513: STATISTICAL METHODS IN CIVIL ENGINEERING Lecture: Introduction to Fourier transforms Dr. Budhaditya Hazra Room: N-37 Department of Civil Engineering 1 Fourier Analysis Fourier Series

More information

E : Lecture 1 Introduction

E : 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 information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 4 Digital Signal Processing Pro. Mark Fowler ote Set # Using the DFT or Spectral Analysis o Signals Reading Assignment: Sect. 7.4 o Proakis & Manolakis Ch. 6 o Porat s Book /9 Goal o Practical Spectral

More information

! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform. " Aka short-time Fourier transform

! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform.  Aka short-time Fourier transform Lecture Outline ESE 531: Digital Signal Processing Spectral Analysis with DFT Windowing Lec 24: April 18, 2019 Spectral Analysis Effect of zero-padding Time-dependent Fourier transform " Aka short-time

More information

Multidimensional digital signal processing

Multidimensional 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 information

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set

More information

Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum

Chapter 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 information

Fourier Analysis of Signals Using the DFT

Fourier Analysis of Signals Using the DFT Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal

More information

Solutions: Homework Set # 5

Solutions: Homework Set # 5 Signal Processing for Communications EPFL Winter Semester 2007/2008 Prof. Suhas Diggavi Handout # 22, Tuesday, November, 2007 Solutions: Homework Set # 5 Problem (a) Since h [n] = 0, we have (b) We can

More information

6.003: Signal Processing

6.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 information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 3 Signals & Systems Prof. ark Fowler Note Set #28 D-T Systems: DT Filters Ideal & Practical /4 Ideal D-T Filters Just as in the CT case we can specify filters. We looked at the ideal filter for the

More information

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

ECSE 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 information

An Introduction to Discrete-Time Signal Processing

An Introduction to Discrete-Time Signal Processing An Introduction to Discrete-Time Signal Processing John A. Gubner 5 4 3 2 0 0.5 0.3 0. 0. 0.3 0.5 Contents From Continuous Time to Discrete Time and Back. Does Sampling Always Lose Information?.2 Review

More information

Digital Signal Processing, Lecture 2 Frequency description continued, DFT

Digital Signal Processing, Lecture 2 Frequency description continued, DFT Outline cture 2 2 Digital Signal Processing, cture 2 Frequency description continued, DFT Thomas Schön Division of Automatic Control Department of Electrical Engineering Linköping i University it E-mail:

More information

Definition of Discrete-Time Fourier Transform (DTFT)

Definition 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 information

Music 270a: Complex Exponentials and Spectrum Representation

Music 270a: Complex Exponentials and Spectrum Representation Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential

More information

Stability Condition in Terms of the Pole Locations

Stability Condition in Terms of the Pole Locations Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability

More information

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you

More information

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous

More information

Chapter 7: The z-transform

Chapter 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 information

DFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6

DFT-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 information

Solutions - Homework # 3

Solutions - Homework # 3 ECE-34: Signals and Systems Summer 23 PROBLEM One period of the DTFS coefficients is given by: X[] = (/3) 2, 8. Solutions - Homewor # 3 a) What is the fundamental period 'N' of the time-domain signal x[n]?

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/

More information

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2: EEM 409 Random Signals Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Consider a random process of the form = + Problem 2: X(t) = b cos(2π t + ), where b is a constant,

More information

J. McNames Portland State University ECE 223 DT Fourier Series Ver

J. McNames Portland State University ECE 223 DT Fourier Series Ver Overview of DT Fourier Series Topics Orthogonality of DT exponential harmonics DT Fourier Series as a Design Task Picking the frequencies Picking the range Finding the coefficients Example J. McNames Portland

More information

Generalizing the DTFT!

Generalizing the DTFT! The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid

More information