EEL3135: Homework #3 Solutions

Size: px
Start display at page:

Download "EEL3135: Homework #3 Solutions"

Transcription

1 EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler relations): cos( πt) cos( 3t) -- cos[ ( 3 π)t] + -- cos[ ( 3+ π)t] (S-) cos( πt) cos( 3t) -- cos[ ( π 3)t] + -- cos[ ( 3+ π)t] Therefore, the CTFT is given by: (S-) Xf () -- δ ( π 3) f δ f 4 π -- [ δ( f + ) + δ( f ) ] ( π 3) π (b) Compute xt () for the following CTFT: Xf () e jπ 3 δ( f + 4) + e jπ 3 δ( f 4). Your final answer should not include the imaginary number j. From the definition of the inverse Fourier transform: -- δ ( 3+ π) f ( 3+ π) + + δ f π π (S-3) xt () Xf ()e jπft df xt () [ e jπ 3 δ( f + 4) + e jπ 3 δ( f 4) ]e jπft df xt () e jπ 3 e j8πt e jπ 3 e j8πt xt () [ e j( 8πt π 3) + e j( 8πt π 3) ] xt () 4 e j( 8πt π 3) + e j( 8πt π 3) + xt () 4cos( 8πt π 3) (S-4) (S-5) (S-6) (S-7) (S-8) (S-9) - -

2 Problem : Consider the continuous-time signal: xt () 5+ cos( πt) + 3sin( 7πt) + cos( 8πt π 4), < t <. (-) (a) What is the fundamental frequency of this periodic signal? Note that xt () is already in the form of a Fourier series: xt () X + X k cos( πkf t+ X k ) k (S-) So, we do not need to compute the Fourier series coefficients through integration. Now, in the Fourier series, all the frequencies have to be integer multiples of πf. By inspection, f Hz, so that the four terms in equation (-) correspond to k, k ±, k ± 7 and k ± 8. (b) Specify the Fourier series coefficients, < k <, for xt (). By comparing equation (-) and (S-), we can find by inspection: f X k X k X 5 X (S-) (S-) X 7 3 e jπ 3j [ sin( 7πt) cos( 7πt π ) ] (S-3) X 8 e jπ 4 5e jπ 4 Using the property that X k X k : X X 7 3j X 8 5e jπ 4 All other Fourier series coefficients are zero. (c) Specify the Fourier series coefficients X' k for the signal x' () t x( t+ ). Starting with the complex Fourier series representation: xt () X k e jπkt k (S-4) (S-5) (S-6) (S-7) (S-8) x( t+ ) X k e jπk( t+ ) k Therefore X k ' X k e jπk. k ( X k e jπk )e jπkt (S-9) - -

3 Problem 3: Consider the periodic sawtooth waveform x () t plotted below..5 t 4 x () t (a) Derive the complex Fourier series coefficients for this waveform. X k Hints: Note that this is just a shifted version of the sawtooth wave xt () in Figure 4 (page 5, Fourier Series notes); that is, x () t xt ( 4). (3-) Therefore, you do not have to derive the X k coefficients from scratch, although you are free to do so (not recommended though). In the Fourier Series lecture notes, we derived the following Fourier series coefficients for the unshifted sawtooth waveform xt (): t t 3 4 ( j( ) X k ) ( πk) k k k (S-) where the complex Fourier series representation is given by, xt () X k e jπkt k Substituting ( t 4) for t in equation (S-): xt ( 4) X k e jπk t 4 k ( ) xt ( 4) X k e jπkt e jπk 4 k ( ) (S-) (S-) (S-3) xt ( 4) ( X k e jπk )e jπkt k From equation (S-4), we observe that the Fourier coefficients X k ' for the shifted waveform are given by, (S-4) X k ' X k e jπk (S-5) X k ' ( j( ) k e jπk ) ( πk) k k (S-6) - 3 -

4 Equation (S-6) can be simplified to: X k ' ( j ( k + ) ) ( πk) k k (S-7) (The result in (S-7) can be verified by direct substitution of integers k.) (b) Plot the frequency spectrum for this waveform. That is, plot and as a function of k, 5 k 5. X k X k X k ' arg( X k ' ) k k (c) Plot the first 5 terms of the trigonometric Fourier series for t. The trigonometric representation of the Fourier series for the shifted waveform is given by, xt ( 4) X ' + X k ' cos( πkt + X k ') k (S-8) So the fifth-order approximation is given by, 5 xt ( 4) X k ' cos( πkt + X k ') k cos( πt + π) cos( 4πt π ) cos( 6πt) cos( 8πt + π ) cos( πt + π) xt ( 4) π π 3π 4π 5π cos( πt) sin( 4πt) cos( 6πt) sin( 8πt) cos( πt) xt ( 4) π π 3π 4π 5π (S-9) (S-3) (S-3) Equation (S-3) is plotted below. (For MATLAB and Mathematica code, see the course web page.) Truncated Fourier series t - 4 -

5 Problem 4: Below, there are two magnitude frequency spectra plotted, corresponding to the following two time-domain signals: x () t cos( 4πt), < t < (4-) x () t cos( 4πt) [ ut () ut ( 5) ], < t < (4-) Specify and explain which signal corresponds to which magnitude frequency spectrum. X a () f X b () f f f The equations below give the correct correspondences between the time and frequency domain plots: x () t X a () f x () t X b () f (S-3) (S-33) Note that X a () f is given by, X a () f --δ ( f + ) + --δ ( f ). (S-34) Also, note that the time limiting of signal x () t causes the frequency content to spread out in the frequency domain

6 Problem 5: Below, the magnitudes of the DTFT are plotted for two sampled signals x [ n] and x [ n] given by, x [ n] x [ n] x c ( n ) x c ( n ) n {,,, 98, 99} elsewhere n {,,, 48, 49} elsewhere where x c () t cos( 4πt), and (5-) where x c () t cos( 4πt). (5-) (a) Are the DTFTs plotted as a function of the frequency variable or frequency f (in Hz)? Since we should expect peaks in the DTFTs at ± Hz, we note that the DTFTs are plotted as a function of frequency f. (b) Specify and explain which discrete-time signal corresponds to which magnitude frequency spectrum. Magnitude spectrum A (DTFT) Magnitude spectrum B (DTFT) The equations below give the correct correspondences between the time and frequency domain plots: x () t spectrum A x () t spectrum B (S-35) (S-36) The signal x [ n] results from longer sampling than x [ n] and therefore its frequency content is more localized about the dominant frequencies of ± Hz

7 Problem 6: Below, the magnitude of the DTFT is plotted for the sampled signal xn [ ] given by, xn [ ] x c ( n ) n {,,, 98, 99} elsewhere where x c () t cos( 4πt). (6-) (a) Label the horizontal axis where indicated, assuming the DTFT is plotted as a function of. (b) Label the horizontal axis where indicated, assuming the DTFT is plotted as a function of f (in Hz). Magnitude spectrum (DTFT) π π π 4π 4Hz Hz Hz Hz 4Hz f Note the correct labeling of the horizontal axis as a function of both and f. Remember that the DTFT is periodic with period π, and that, as a function of frequency, the spectrum of the continuous-time waveform is replicated at ± kf s, where k is an integer

8 Problem 7: Below, two magnitude frequency spectra are plotted for two signals x () t and x [ n] given by, x () t cos( 4πt) [ ut () ut ( 5) ], and, (7-) x [ n] x ( n ) n {,,, 48, 49} elsewhere (7-) (a) To what variable does the horizontal axis in each plot correspond? The magnitude spectra are plotted as a function of frequency f in Hertz. (b) Specify and explain which signal corresponds to which magnitude frequency spectrum. The equations below give the correct correspondences between the time and frequency domain plots: x () t spectrum B x [ n] spectrum A (S-37) (S-38) Note that the time-limited continuous-time signal x () t has dominant frequencies at ± Hz, while the sampled version of the signal has the original spectrum replicated at ± kf s, where k is an integer. (c) Specify to which frequency transform each magnitude spectrum corresponds (e.g. CTFT, DTFT, DFT). Magnitude spectrum A corresponds to the DTFT, while magnitude spectrum B corresponds to the CTFT. Magnitude spectrum A - - Magnitude spectrum B

9 Problem 8: Below, the magnitudes of the DTFT are plotted for two sampled signals x [ n] and x [ n] given by, x [ n] x c ( n 3) n {,,, 8, 9} elsewhere where x c () t + cos( 4πt), and (8-) x [ n] x c ( n ) n {,,, 8, 9} elsewhere where x c () t + cos( 4πt). (8-) (a) Specify and explain which discrete-time signal corresponds to which magnitude frequency spectrum. (b) Indicate to which frequency (in Hz) each of the dominant peaks in the plots corresponds. Magnitude spectrum A Magnitude spectrum B The equations below give the correct correspondences between the time and frequency domain plots: x [ n] spectrum A x [ n] spectrum B (S-39) (S-4) Note that the sampling frequency of 3Hz for x [ n] is below the Nyquist sampling frequency of 4Hz, and so aliasing occurs. The peaks for spectrum A correspond to ± khz, where k is an integer. On the other had, the sampling frequency of Hz for x [ n] is above the Nyquist sampling frequency of 4Hz, and so aliasing does not occur. The peaks for spectrum B correspond to: { + k, + k, + k} (in Hertz) (S-4) where k is an integer. To understand these plots, you can perform a similar analysis as for problems and on homework #, assuming infinite-length sampling of x c () t

10 Problem 9: On the next page, the shape of ten magnitude frequency spectra are plotted as a function of frequency f (in Hertz) corresponding to ten of the following eleven time-domain signals: B/CTFT H/CTFT E/CTFT C/DTFT D/DTFT J/DTFT F/DTFT A/DTFT G/DTFT I/DTFT none x () t + sin( 6πt), < t < (9-) x () t x ()ut t [ ut ( ) ], < t < (9-) x 3 () t x ()ut t [ ut ( 3) ], < t < (9-3) x 4 [ n] x ( n ), < n < (9-4) x 5 [ n] x ( n ) ( un [ ] un [ ] (9-5) x 6 [ n] x ( n ) ( un [ ] un [ ] (9-6) x 7 [ n] x ( n ) ( un [ ] un [ 4] (9-7) x 8 [ n] x ( n 6) ( un [ ] un [ 4] (9-8) x 9 [ n] x ( n 5) ( un [ ] un [ ] (9-9) x [ n] x ( n 4) ( un [ ] un [ 6] (9-) x [ n] x ( n 3) ( un [ ] un [ ] (9-) (Note that the first three signals are continuous-time signals, while the last eight signals are discrete-time signals, and that one of the above signals does not correspond to any of the magnitude spectra shown.) (a) For each of the above time-domain signals, assign its corresponding frequency spectrum (i.e. A, B, C, D, E, F, G, H, I, J), or indicate none if none of the frequency spectra correspond to a particular signal. See the above labeling. The reason the DTFT of signal x 8 [ n] does not have multiple peaks is because of the discrete sequence generated by a sampling frequency of f s 6 Hz is given by: 6πn x 8 [ n] + sin ,. (S-4) 6 + sin( πn) n {,,,, 3} That is, it represents a discrete time pulse of width 4. Also, note the aliasing for signals x 9 [ n] and x [ n]. (b) For each frequency spectrum, label it as either a CTFT or a DTFT. See the above labeling. - -

11 Problem 9 figures Magnitude frequency spectra (as function of frequency f) A B C D E F G H I J

12 Problem : (a) Compute the DTFT ( ) of the following discrete-time signal: Xe j xn [ ] δ[ n n ] (-) From the definition of the DTFT: ( ) xn [ ]e jn Xe j Xe j n e jn ( ) δ[ n n ]e jn (S-43) (S-44) (b) For n, sketch Xe ( j ), π < < π. For n, ( ) e j Xe j See the magnitude plot below. (S-45).5.5 Xe ( j ) Xe ( j ) (c) For n, sketch Xe ( j ), π < < π. See the phase plot above. (d) Compute the DTFT ( ) of the following discrete-time signal: Xe j xn [ ] δ[ n 3] + δ[ n + 3] and plot ( ). Xe j From the definition of the DTFT: ( ) δ[ n 3]e j3 + δ[ n + 3]e ; j3 e j3 + e ; j3 cos( 3) Xe j (-) (S-46) - -

13 Problem : (a) Assume the magnitude plot Xk ( ) of the DFT of a real-valued, discrete-time signal xn [ ] is given by the plot below, and that xn [ ] was sampled from a continuous-time signal at a sampling frequency of Hz. Specify the set of discrete-time signals consistent with Xk ( ). Xk ( ) k The length of the DFT is N, and the sampling frequency is given as f s Hz. Therefore, k 4 k 6 k 8 f 4 ( ) Hz f ( 6 ) ( ) Hz f 8 ( ) 4 Hz (S-47) (S-48) (S-49) k f ( ) ( ) 4 Hz Since we are not given the phase of the DFT or the absolute magnitude, the set of discrete-time signals that are consistent with Xk ( ) is given by: (S-5) xn [ ] 4πn xn [ ] A α 8πn cos β cos A πn α 4πn cos β 5 cos 5 (S-5) where A, α and β can be any real-valued scalars. (b) Suppose that X( 6) π 4 and X( 8) π 3. Plot Xk ( ) for k {,,, 8, 9}. For all the zero DFT components Xk ( ). For the other two nonzero components: X( 4) X( 6) π 4 X( ) X( 8) π 3 See the plot below for the phase DFT as a function of index k. (S-5) (S-53) 3 Xk ( ) k - 3 -

14 (c) Sketch the magnitude DFT as a function of frequency (in Hertz). See the plot below for the magnitude DFT as a function of frequency f. magnitude spectrum f (d) Which of the following frequencies cannot be represented exactly by this DFT? f.5 Hz, f.75 Hz, f 6 Hz. (-) The frequency resolution of this DFT is ( ).5 Hz. Therefore, f.75 Hz cannot be represented by this DFT. Also, since the sampling frequency is Hz, the maximum frequency that can be represented by this DFT is ( ) 5 Hz. Therefore, f 6 Hz cannot be represented by this DFT

15 Problem : Below, the magnitudes of the DFT are plotted for two sampled signals x [ n] and x [ n] given by, x [ n] x [ n] x c ( n 7) x c ( n 7) n {,,, 8, 9} elsewhere n {,,, 8, 9} elsewhere where x c () t cos( πt), and (-) where x c () t cos( π( )t). (-) (a) Specify and explain which discrete-time signal corresponds to which magnitude frequency spectrum (DFT). The equations below give the correct correspondences between the time and frequency domain plots: x [ n] X a ( k) x [ n] X b ( k) (S-54) (S-55) This is because the sampled signal x c () t has frequency /Hz, which is an integer multiple of f s N 7 Hz, while the sampled signal x c () t has frequency Hz, which is not an integer multiple of 7 Hz. (b) For each of the indexes k below, indicate the corresponding frequency f : k, k 3, k 7. (-3) For the DFT, the frequency resolution is given by N, which for this example is given by 7 Hz. Then, f s { k } { Hz} { k 3} { 37 ( )Hz Hz} (S-56) (S-57) { k 7} { 37 ( ) Hz Hz} (c) For each of the frequencies f below, indicate whether or not the DFT can represent those frequencies exactly: (S-58) f.35 Hz, f Hz, f.4 Hz, f.5 Hz. (-4) The DFT can only represent integer multiples of 7.35 Hz exactly. Therefore,.35Hz and.4hz can be represented exactly in the DFT representation. X a ( k) X b ( k) k k - 5 -

16 Problem 3: (a) Match each discrete-time signal to its corresponding magnitude DTFT representation. Explain your answer. x [ n] X c ( e j ), x [ n] X a ( e j ), x 3 [ n] X b ( e j ) (S-59) Explanation: x [ n] is a windowed pulse function, and should therefore exhibit less spectral leakage than the other two signals; x [ n] is spread out more in the time domain than x 3 [ n], and therefore will result in a more focused representation in the frequency domain. x [ n] X a ( e j ) n x [ n] X b ( e j ) n x 3 [ n] X c ( e j ) n (b) Match each of the following discrete-time signals, x [ n] xn ( 3) ( un [ ] un [ 5] (3-) x [ n] xn ( 3) ( un [ ] un [ 3] (3-) x 3 [ n] xn ( 8) ( un [ ] un [ 4] (3-3) x 4 [ n] xn ( 8) ( un [ ] un [ 8] (3-4) x 5 [ n] xn ( ) ( un [ ] un [ ] (3-5) x 6 [ n] xn ( ) ( un [ ] un [ ] (3-6) - 6 -

17 X a ( e j ) X b ( e j ) X c ( e j ) 4 X d ( e j ) X e ( e j ) X f ( e j ) where xt () + cos( 4πt), < t <, to its corresponding magnitude DTFT representation below. Recall that ( πf) f s. Explain your answer. x [ n] X a ( e j ) x 6 [ n] X c ( e j ), x [ n] X f ( e j ), x 3 [ n] X d ( e j ), x 4 [ n] X e ( e j ), x 5 [ n] X b ( e j ), (S-6) Explanation: Signals x [ n] and x [ n] are undersampled and should exhibit peaks at ± Hz and Hz [easily derivable through idealized aliasing analysis], corresponding to values, ( πf) f s ± π 3, (S-6) Signals x 3 [ n] and x 4 [ n] are sufficiently sampled and should exhibit peaks at ± Hz and Hz, corresponding to values, ( πf) f s ± 4π 8, ± π, (S-6) Similarly, signals x 5 [ n] and x 6 [ n] are sufficiently sampled and should exhibit peaks at, ( πf) f s ± 4π, ± π 5, (S-63) The above analysis helps us narrow down the potential matches for each time-domain signal to two. Exact matches between time-domain signals and frequency domain representations are made by realizing that longer-sampled sequences in the time-domain will result in more focused representations in the frequency domain

18 Problem 4: (a) Write a computer program (MATLAB, Mathematica, etc.) to plot the magnitude and phase (as a function of ) of the DTFT for the following discrete-time signal: x [ n] x c ( n ) n {,,, } elsewhere where x c () t cos( πt) + 3cos( 4πt). (4-) (a) Now plot the magnitude and phase (as a function of ) of the DTFT for the following discrete-time signal: x [ n] x [ n + ] (4-) where x [ n] is given in (4-) above. See the plots below. Note that the shift in equation (4-) only affects the phase part of the DTFT, not the magnitude part of the DTFT. (For MATLAB and Mathematica code, see the course web page.) X ( e j ) (a) - - X ( e j ) X ( e j ) (b).5 X ( e j )

In this Lecture. Frequency domain analysis

In this Lecture. Frequency domain analysis In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier

More information

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators

More information

Discrete Fourier Transform

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

Question Paper Code : AEC11T02

Question Paper Code : AEC11T02 Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)

More information

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis OSE81 Engineering System Identification Lecture 5: Fourier Analysis What we will study in this lecture: A short introduction of Fourier analysis Sampling the data Applications Example 1 Fourier Analysis

More information

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3 The Discrete Fourier Transform Signal Processing PSYCH 711/712 Lecture 3 DFT Properties symmetry linearity shifting scaling Symmetry x(n) -1.0-0.5 0.0 0.5 1.0 X(m) -10-5 0 5 10 0 5 10 15 0 5 10 15 n m

More information

ECE 301 Fall 2011 Division 1. Homework 1 Solutions.

ECE 301 Fall 2011 Division 1. Homework 1 Solutions. ECE 3 Fall 2 Division. Homework Solutions. Reading: Course information handout on the course website; textbook sections.,.,.2,.3,.4; online review notes on complex numbers. Problem. For each discrete-time

More information

L29: Fourier analysis

L29: Fourier analysis L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis

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

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

Sinc Functions. Continuous-Time Rectangular Pulse

Sinc Functions. Continuous-Time Rectangular Pulse Sinc Functions The Cooper Union Department of Electrical Engineering ECE114 Digital Signal Processing Lecture Notes: Sinc Functions and Sampling Theory October 7, 2011 A rectangular pulse in time/frequency

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

Continuous Fourier transform of a Gaussian Function

Continuous Fourier transform of a Gaussian Function Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain

More information

Homework 8 Solutions

Homework 8 Solutions EE264 Dec 3, 2004 Fall 04 05 HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation

More information

Chap 4. Sampling of Continuous-Time Signals

Chap 4. Sampling of Continuous-Time Signals Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion

More information

The Discrete-Time Fourier Transform (DTFT)

The Discrete-Time Fourier Transform (DTFT) EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) The Discrete-Time Fourier Trasorm (DTFT). Itroductio I these otes, we itroduce the discrete-time Fourier trasorm (DTFT) ad

More information

Each problem is worth 25 points, and you may solve the problems in any order.

Each problem is worth 25 points, and you may solve the problems in any order. EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions

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

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

Solutions to Assignment 4

Solutions to Assignment 4 EE35 Spectrum Analysis and Discrete Time Systems (Fall 5) Solutions to Assignment. Consider the continuous-time periodic signal: x(t) = sin(t 3) + sin(6t) (8) [] (a) Obviously, the fundamental frequency

More information

ECE 301: Signals and Systems Homework Assignment #3

ECE 301: Signals and Systems Homework Assignment #3 ECE 31: Signals and Systems Homework Assignment #3 Due on October 14, 215 Professor: Aly El Gamal A: Xianglun Mao 1 Aly El Gamal ECE 31: Signals and Systems Homework Assignment #3 Problem 1 Problem 1 Consider

More information

DSP-I DSP-I DSP-I DSP-I

DSP-I DSP-I DSP-I DSP-I NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79

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

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform Fundamentals of the Discrete Fourier Transform Mark H. Richardson Hewlett Packard Corporation Santa Clara, California The Fourier transform is a mathematical procedure that was discovered by a French mathematician

More information

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet NAME: NAME EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, 2017 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet

More information

Interchange of Filtering and Downsampling/Upsampling

Interchange 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

Problem Value

Problem Value GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation

More information

Assignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology

Assignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology Signal Processing and Speech Communication Lab. Graz University of Technology Assignment 2 This homework has to be submitted via e-mail to the address hw1.spsc@tugraz.at not later than 25.5.2016. Let the

More information

Fourier series for continuous and discrete time signals

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

Discrete-time Signals and Systems in

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

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

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

Good Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.

Good Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems. EE 637 Final May 4, Spring 200 Name: Instructions: This is a 20 minute exam containing five problems. Each problem is worth 20 points for a total score of 00 points You may only use your brain and a pencil

More information

The Discrete Fourier Transform

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

3.2 Complex Sinusoids and Frequency Response of LTI Systems

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

Chapter 2: Problem Solutions

Chapter 2: Problem Solutions Chapter 2: Problem Solutions Discrete Time Processing of Continuous Time Signals Sampling à Problem 2.1. Problem: Consider a sinusoidal signal and let us sample it at a frequency F s 2kHz. xt 3cos1000t

More information

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet Name: Final Exam ECE3 Signals and Systems Friday, May 3, 3 Cover Sheet Write your name on this page and every page to be safe. Test Duration: minutes. Coverage: Comprehensive Open Book but Closed Notes.

More information

Lecture 27 Frequency Response 2

Lecture 27 Frequency Response 2 Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period

More information

Introduction to Complex Mathematics

Introduction to Complex Mathematics EEL335: Discrete-Time Signals and Systems. Introduction In our analysis of discrete-time signals and systems, complex numbers will play an incredibly important role; virtually everything we do from here

More information

University Question Paper Solution

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

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided

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

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet Solution 7 August 2015 ECE301 Signals and Systems: Final Exam Cover Sheet Test Duration: 120 minutes Coverage: Chap. 1, 2, 3, 4, 5, 7 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes

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

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1

More information

EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points

EE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points EE 637 Final April 30, Spring 2018 Name: Instructions: This is a 120 minute exam containing five problems. Each problem is worth 20 points for a total score of 100 points You may only use your brain and

More information

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

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)

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

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

Fourier Analysis Overview (0A)

Fourier Analysis Overview (0A) CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute

More information

Solutions to Problems in Chapter 4

Solutions to Problems in Chapter 4 Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A system that is both linear and time-invariant is called linear time-invariant (LTI). The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped

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

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

Fourier Analysis Overview (0A)

Fourier Analysis Overview (0A) CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute

More information

Homework 9 Solutions

Homework 9 Solutions 8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 207 Homework 9 Solutions Part One. (6 points) Compute the convolution of the following continuous-time aperiodic signals. (Hint: Use the

More information

Problem Value

Problem Value GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation

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

CH.4 Continuous-Time Fourier Series

CH.4 Continuous-Time Fourier Series CH.4 Continuous-Time Fourier Series First step to Fourier analysis. My mathematical model is killing me! The difference between mathematicians and engineers is mathematicians develop mathematical tools

More information

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1? Second Year Engineering Mathematics Laboratory Michaelmas Term 998 -M L G Oldfield 30 September, 999 Exercise : Fourier Series & Transforms Revision 4 Answer all parts of Section A and B which are marked

More information

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005 1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.341 Discrete-Time Signal Processing Fall 2005 FINAL EXAM Friday, December 16, 2005 Walker (50-340) 1:30pm

More information

Signal Processing Signal and System Classifications. Chapter 13

Signal Processing Signal and System Classifications. Chapter 13 Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals

More information

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier

More information

The Fourier Transform (and more )

The Fourier Transform (and more ) The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider

More information

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 8: Signal Reconstruction, D vs C Processing Oct 24, 2001 Prof: J. Bilmes

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

ECE-314 Fall 2012 Review Questions for Midterm Examination II

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

University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis

University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical

More information

Fourier Representations of Signals & LTI Systems

Fourier Representations of Signals & LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n] 2. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing Radar Systems Engineering Lecture Review of Signals, Systems and Digital Signal Processing Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course Review Signals, Systems & DSP // Block Diagram of

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

Distortion Analysis T

Distortion Analysis T EE 435 Lecture 32 Spectral Performance Windowing Spectral Performance of Data Converters - Time Quantization - Amplitude Quantization Quantization Noise . Review from last lecture. Distortion Analysis

More information

Two-Dimensional Signal Processing and Image De-noising

Two-Dimensional Signal Processing and Image De-noising Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 14, 2016 Before we considered (one-dimensional) discrete signals of the form x : [0, N 1] C where

More information

I. Signals & Sinusoids

I. Signals & Sinusoids I. Signals & Sinusoids [p. 3] Signal definition Sinusoidal signal Plotting a sinusoid [p. 12] Signal operations Time shifting Time scaling Time reversal Combining time shifting & scaling [p. 17] Trigonometric

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

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1. 84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4

More information

FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher

FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher Everything presented here is specifically focused on non-periodic signals with finite energy (also called energy signals

More information

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1 ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Let x be a periodic continuous-time signal with period, such that {, for.5 t.5 x(t) =, for.5

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet NAME: December Digital Signal Processing I Final Exam Fall Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Three 8.5 x crib sheets allowed Calculators NOT allowed. This test contains four

More information

Final Exam January 31, Solutions

Final Exam January 31, Solutions Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points

More information

LAB 6: FIR Filter Design Summer 2011

LAB 6: FIR Filter Design 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 6: FIR Filter Design Summer 011

More information

EE Homework 13 - Solutions

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

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 3 Signals & Systems Pro. Mark Fowler Discussion #9 Illustrating the Errors in DFT Processing DFT or Sonar Processing Example # Illustrating The Errors in DFT Processing Illustrating the Errors in

More information

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. Final Exam of ECE301, Section 3 (CRN 17101-003) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and

More information

6.003 Homework #10 Solutions

6.003 Homework #10 Solutions 6.3 Homework # Solutions Problems. DT Fourier Series Determine the Fourier Series coefficients for each of the following DT signals, which are periodic in N = 8. x [n] / n x [n] n x 3 [n] n x 4 [n] / n

More information

SNR Calculation and Spectral Estimation [S&T Appendix A]

SNR Calculation and Spectral Estimation [S&T Appendix A] SR Calculation and Spectral Estimation [S&T Appendix A] or, How not to make a mess of an FFT Make sure the input is located in an FFT bin 1 Window the data! A Hann window works well. Compute the FFT 3

More information

1.3 Frequency Analysis A Review of Complex Numbers

1.3 Frequency Analysis A Review of Complex Numbers 3 CHAPTER. ANALYSIS OF DISCRETE-TIME LINEAR TIME-INVARIANT SYSTEMS I y z R θ x R Figure.8. A complex number z can be represented in Cartesian coordinates x, y or polar coordinates R, θ..3 Frequency Analysis.3.

More information

1 Introduction & Objective

1 Introduction & Objective Signal Processing First Lab 13: Numerical Evaluation of Fourier Series Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in

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

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. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information