Assignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology
|
|
- Clemence Heath
- 5 years ago
- Views:
Transcription
1 Signal Processing and Speech Communication Lab. Graz University of Technology Assignment 2 This homework has to be submitted via to the address hw1.spsc@tugraz.at not later than Let the subject of the be YourMatro YourColleague smatro. The body of the should be empty (nobody will read it). A complete project consists of Matlab/Octave files (*.m) and a simulation protocol in PDF format. You have to zip all these files to a single file with name YourMatro YourColleague s Matro.zip which has to be attached to the . In addition to the , you have to throw your printed (paper format) simulation protocols and your analytic solutions into our mailbox at Inffeldgasse 16c, ground floor, not later than (note that you cannot access the mailbox on weekends). For each problem, staple your solutions separately. Use the print-out of the respective problem assignment as the title page(s). Don t forget to fill in your name(s), matr. number(s), and group number(s). If you typeset your analytic solutions with L A TEX, you can get bonus points. If you submit a handwritten protocol, be aware that it should be clear, tidy and readable. Otherwise, you will be charged with five penalty points.
2 Analytical Problem 2.1 (4 points) Let x[n] = (1 + e j 5π 1 2 )δ[n] ( 2 + π ej 2 )δ[n 1] denote a complex-valued discrete-time signal with DTFT X ( e jθ). (a) [2 point(s)] Using properties of the Fourier transform calculate the following expressions: 1. X ( e jθ) θ=0 2. +π π X ( e jθ) 2 dθ (b) [1 point(s)] Using again properties of the Fourier transform calculate the time domain signals following the expressions below: 1. y 1 [n] = DTFT 1 {I{X ( e jθ) }} 2. y 2 [n] = DTFT 1 {X ( e jθ) } (c) [1 point(s)] Sketch the real and imaginary parts of y 1 [n] and y 2 [n] separately.
3 Analytical Problem 2.2 (6 points) The following impulse response of a system is given: h 1 [n] = u[n] u[n 2] u[n 3] + u[n 5], where u[n] is the discrete-time unit-step function. (a) [1 point(s)] Sketch the impulse response h 1 [n]. What property does the phase-response of this system have (justify your answer)? (b) [2 point(s)] Calculate H 1 (e jθ ) = DTFT{h 1 [n]} without using DTFT-pairs and sketch its amplitude and phase spectrum for 2π < θ < 2π. Make sure that the zeros of the amplitude spectrum are correctly aligned on the frequency axis. ( (c) [1 point(s)] Find a scaling factor α so that α H ) 1 e jθ θ= π 2 sequence h 1 [n] = DTFT 1 {αh 1 ( e jθ ) } is equal to one. Determine the (d) [2 point(s)] Consider a second system with impulse response ( ) 2π h 2 [n] = cos 3 n. h 1 [n] and h 2 [n] are connected in series yielding the overall impulse response h 3 [n] given by: h 3 [n] = h 1 [n] h 2 [n] Determine h 3 [n]. (Hint: Illustrating the frequency responses in Octave may help.)
4 Analytical Problem 2.3 (5 points) Consider the following discrete-time sequence x[n] = δ[n] δ[n 1] + δ[n 2] (a) [1 point(s)] Find the sequence x 1 [n] = DTFT 1 {X ( e jθ) e jθn 0 }, where X ( e jθ) is the DTFT of x[n] and n 0 is an integer. (b) [1.5 point(s)] ow let X[k] be samples of X ( e jθ), i.e.: X[k] = X ( e jθ) θ= 2πk, k = 0, 1,..., 1, with = 5. Find the -point sequence x 1 [n] that corresponds to: x 1 [n] = DFT 1 2πk {X[k]ej n 0 }. (c) [1.5 point(s)] Sketch x 1 [n] and x 1 [n] for n = 0, 1,..., 1 for n 0 = 3. Can you find a value n 0 3 that yields the same x 1 [n]? (d) [1 point(s)] What is the minimum DFT-length so that x 1 [n] = x 1 [n] holds for n = 0, 1,..., 1 if n 0 = 3? Justify your choice.
5 Octave Problem 2.4 (10 points) Consider the following 1 -point sequence representing a discrete-time domain signal x 1 [n] = A 1 cos (ω 1 n + φ 1 ), n = 0,..., 1 1, where 1 is some fixed integer and the normalized angular frequency ω 1 is defined by ω 1 = 2π f 1 f S. Further, f 1 is a frequency in (Hz) and f S is the sampling frequency. (a) [1 point(s)] Let s assume we have the following parameters: A 1 = 2, f 1 = 7 4 Hz, f S = 8Hz, φ 1 = 0. Given the sampling frequency f S choose 1 so that it corresponds to 4 s. ow generate the index sequence {n 1 } = {0, 1,..., 1 1}, which can be expressed as a vector n 1 in Octave. Given the parameters defined above compute the signal vector x 1 and visualize it using figure and stem. Make sure that the x-axis is indexed correctly (with {n 1 }) and don t forget to label both axes! (b) [2 point(s)] Compute the 1 -point DFT of x 1 [n] X 1 [k] = DFT{x 1 [n]} = 1 1 n=0 x 1 [n]e j2πkn/ 1 using the function fft. X 1 [k] is a complex spectrum consisting of 1 complex values. Illustrate the absolute value of the spectrum by applying abs, figure and stem. Again make sure that the x-axis is indexed correctly. For this purpose generate the frequency index sequence k 1 : {k 1 } = {0, 1,..., 1 1} What can you say about the absolute values X 1 [k] at k = f 1 1 f S and k = 1 f 1 1 f S (the maxima of X 1 [k] )? Can you compute A 1 from these values? If the underlying discrete-time sequence x[n] is real-valued, is there in general a way to obtain the angle of X[k] at k = /2+a if one only knows the angle of X[k] at k = /2 a (with integer a {0,..., /2})? (c) [2 point(s)] ow extend your vector x 1 by 0 = 2000 zeros with the help of the function zeros (this operation is a general concept called zero-padding). We will refer to the new vector as x 1. Evaluate the new vector s length Ñ1 by utilizing one of the following functions: numel, length or size. Compute the corresponding Ñ1-point DFT X 1 [k] with fft. The normalized angular frequency at frequency index k is given by θ k = 2πk. Compute the values of θ k for the DFT lengths 1 and Ñ1 separately to obtain θ k,1 and θ k,1, respectively. In order to illustrate the impact of the zero-padding we will now compare the DFT representations of x 1 [n] and x 1 [n]. Use plot to plot X 1 [k] against θ k,1 and stem to visualize X 1 [k] against
6 θ k,1, both in the same plot. (Hint: hold on lets you overlap the two curves.) What do you observe? How are the DTFT and the DFT of a sequence related? (d) [2 point(s)] We now define a second signal with the following parameters: A 2 = 2, f 2 = 8 5 Hz, f S = 8Hz, φ 2 = 0, 2 = 1. In Octave, generate vectors representing an index sequence n 2 and the corresponding discretetime sequence x 2 [n] following and {n 2 } = {0, 1,..., 2 1}, x 2 [n] = A 2 cos (ω 2 n + φ 2 ), n = 0,..., 2 1, with ω 2 = 2π f 2 f S. ow follow the same steps as in task 2.4 (b) in order to illustrate the 2 -point DFT X 2 [k] of x 2 [n] by figure and stem (don t forget to compute the correct index vector k 2 to have a valid representation!). What do you observe? ow zero-pad the vector x 2 with 0 = 2000 zeros in order to obtain x 2 with Ñ2 entries. Compute the Ñ2-point DFT X 2 [k] of x 2 [n] and generate two vectors containing the normalized angular frequencies θ k,2 and θ k,2 for both DFT lengths, 2 and Ñ2. Similar to 2.4 (b) illustrate the absolute value of both spectra in one plot using figure and plot for plotting X 2 [k] against θ k,2 and stem to plot X 2 [k] against θ k,2 (both in one plot again). Discuss your observations. (e) [1 point(s)] Find a value for 2 yielding X 2 [k] to be nonzero only for the two frequency indices k = f 2 2 f S and k = 2 f 2 2 f S i.e.: { 2 A 2, k = f f X 2 [k] = S, 2 f 2 2 f S 0, elsewhere Illustrate your results by plotting X 2 [k], resulting from using the new 2 you have chosen. (f) [1 point(s)] By simply restricting the time-domain signal to the interval n = 0, 1,..., 1 we window the signal with a rectangular window of length. The window choice plays an important role in signal-processing applications and the rectangular window is not always the optimal choice. Thus, in this task we apply a blackman window on a discrete-time signal and compare it to the outcome of a rectangular window. Generate the signal ( ) 5ω1 x 3 [n] = A 1 cos 4 n, with the same vector n 1 and parameters A 1 and ω 1 as in 2.4 (a). Compute the signal x 4 [n] following x 4 [n] = x 3 [n] + x 1 [n],
7 represented by the vector x 4. Generate a blackman-window as a vector w B of length 1 by using blackman(), with the window-length as argument. The rectangular window vector w R of same length can be obtained by using ones. The windowed vectors can now be computed by x 4,R = x 4 w R x 4,B = x 4 w B, where the operator denotes the Hadamard product, which means that the vectors are multiplied elementwise. Zero-pad both vectors with 0 zeros and plot the absolute values of the corresponding spectra via fft, abs, plot and hold on in one figure. Label the x-axis correctly and use legend in order to clarify which curve belongs to the rectangular window and which one to the blackman window. What do you observe? (g) [1 point(s)] ow zero-pad the window vectors w R and w B with 0 zeros to obtain w R and w B, respectively. Compute their DFTs W R and W B, by using fft. ow normalize (divide) both vectors by the sum (sum) of the absolute values of their entries individually and you get W R,norm and W B,norm. Plot both, W R,norm and W B,norm, into the same figure. (Hint: Here, the command fftshift may help; you can obtain the corresponding frequency-axis by θ k,1 π). Do not forget to label the x-axis correctly and use a legend. What is a possible disadvantage of the rectangular window (what can you tell about the main lobes and the side lobes of the two window types)?
Adaptive Systems Homework Assignment 1
Signal Processing and Speech Communication Lab. Graz University of Technology Adaptive Systems Homework Assignment 1 Name(s) Matr.No(s). The analytical part of your homework (your calculation sheets) as
More informationLAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More informationCentre for Mathematical Sciences HT 2017 Mathematical Statistics
Lund University Stationary stochastic processes Centre for Mathematical Sciences HT 2017 Mathematical Statistics Computer exercise 3 in Stationary stochastic processes, HT 17. The purpose of this exercise
More informationLAB 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 informationEEL3135: 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 informationMASSACHUSETTS 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 informationEEL3135: Homework #3 Solutions
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
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationVII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.
1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n 2 Note that W N k = 0 but
More informationFourier 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 informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More information! 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 informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationLABORATORY 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 informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationDigital 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 informationDiscrete Fourier Transform (DFT) & Fast Fourier Transform (FFT) Lab 9
Discrete Fourier Transform (DFT) & Fast Fourier Transform (FFT) Lab 9 Last Time We found that an approximation to the Continuous Time Fourier Transform may be found by sampling x t at every mδt and turning
More informationECE 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 informationHomework 1 Solutions
18-9 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 18 Homework 1 Solutions Part One 1. (8 points) Consider the DT signal given by the algorithm: x[] = 1 x[1] = x[n] = x[n 1] x[n ] (a) Plot
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationExperiment 1: Linear Regression
Experiment 1: Linear Regression August 27, 2018 1 Description This first exercise will give you practice with linear regression. These exercises have been extensively tested with Matlab, but they should
More informationEDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015
EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly
More informationReview: 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 informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More informationUNIVERSITY 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 informationTemperature measurement
Luleå University of Technology Johan Carlson Last revision: July 22, 2009 Measurement Technology and Uncertainty Analysis - E7021E Lab 3 Temperature measurement Introduction In this lab you are given a
More informationSIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals
SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z
More informationMusic 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 informationHomework #1 Solution
February 7, 4 Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 734 VLSI Array Structures for Digital Signal Processing Homework # Solution Due: February 6, 4 in class.
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Alejandro Ribeiro January 19, 2018 Let x : [0, N 1] C be a discrete signal of duration N and having elements x(n) for n [0, N 1]. The discrete Fourier transform (DFT) of
More informationQuestion 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 informationE2.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 informationMATLAB and Mathematical Introduction Will be discussed in class on 1/24/11
MATLAB and Mathematical Introduction Will be discussed in class on 1/24/11 GEOP 523; Theoretical Seismology January 17, 2011 Much of our work in this class will be done using MATLAB. The goal of this exercise
More informationDepartment 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 informationLab 6: Linear Algebra
6.1 Introduction Lab 6: Linear Algebra This lab is aimed at demonstrating Python s ability to solve linear algebra problems. At the end of the assignment, you should be able to write code that sets up
More informationLab 4: Quantization, Oversampling, and Noise Shaping
Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationLab 4 Numerical simulation of a crane
Lab 4 Numerical simulation of a crane Agenda Time 10 min Item Review agenda Introduce the crane problem 95 min Lab activity I ll try to give you a 5- minute warning before the end of the lab period to
More informationDesigning Information Devices and Systems I Spring 2018 Homework 11
EECS 6A Designing Information Devices and Systems I Spring 28 Homework This homework is due April 8, 28, at 23:59. Self-grades are due April 2, 28, at 23:59. Submission Format Your homework submission
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationTopics: Discrete transforms; 1 and 2D Filters, sampling, and scanning
EE 637 Study Solutions - Assignment 3 Topics: Discrete transforms; and D Filters, sampling, and scanning Spring 00 Exam : Problem 3 (sampling Consider a sampling system were the input, s(t = sinc(t, is
More informationL6: Short-time Fourier analysis and synthesis
L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude
More informationFourier Series and the DFT
Laboratory 4 June 10, 2002, Release v3.0 EECS 206 Laboratory 4 Fourier Series and the DF 4.1 Introduction As emphasized in the previous lab, sinusoids are an important part of signal analysis. We noted
More information6.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 informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More informationEE301 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 informationB.3 Solving Equations Algebraically and Graphically
B.3 Solving Equations Algebraically and Graphically 1 Equations and Solutions of Equations An equation in x is a statement that two algebraic expressions are equal. To solve an equation in x means to find
More information1 Binary Classification
CS6501: Advanced Machine Learning 017 Problem Set 1 Handed Out: Feb 11, 017 Due: Feb 18, 017 Feel free to talk to other members of the class in doing the homework. You should, however, write down your
More informationLecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)
Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1
More informationThe Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Final May 4, 2012 Time: 3 hours. Close book, closed notes. No calculators. Part I: ANSWER ALL PARTS. WRITE
More informationEE 380 EXAM II 3 November 2011 Last Name (Print): First Name (Print): ID number (Last 4 digits): Section: DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO
EE 380 EXAM II 3 November 2011 Last Name (Print): First Name (Print): ID number (Last 4 digits): Section: DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO Problem Weight Score 1 25 2 25 3 25 4 25 Total
More informationReview 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 informationGeorge Mason University ECE 201: Introduction to Signal Analysis Spring 2017
Assigned: March 20, 2017 Due Date: Week of April 03, 2017 George Mason University ECE 201: Introduction to Signal Analysis Spring 2017 Laboratory Project #6 Due Date Your lab report must be submitted on
More informationDistortion 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 informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationProgramming Assignment 4: Image Completion using Mixture of Bernoullis
Programming Assignment 4: Image Completion using Mixture of Bernoullis Deadline: Tuesday, April 4, at 11:59pm TA: Renie Liao (csc321ta@cs.toronto.edu) Submission: You must submit two files through MarkUs
More informationTwo-Dimensional Signal Processing and Image De-noising
Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 12, 2018 Until now, we considered (one-dimensional) discrete signals of the form x : [0, N 1] C of
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationDHANALAKSHMI 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 informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More information6.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 informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More information6.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 informationSNR 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 informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationDiscrete-Time Fourier Transform
Discrete-Time Fourier Transform Chapter Intended Learning Outcomes: (i) (ii) (iii) Represent discrete-time signals using discrete-time Fourier transform Understand the properties of discrete-time Fourier
More informationHW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1
HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)
More informationSolution 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 informationEEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.
EEE400F EXAM DIGITAL SIGNAL PROCESSING PART A Basic digital signal processing theory.. A sequencex[n] has a zero-phase DTFT X(e jω ) given below: X(e jω ) University of Cape Town Department of Electrical
More informationL29: 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 informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
More informationUNIVERSITY 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 informationLaboratory handout 5 Mode shapes and resonance
laboratory handouts, me 34 82 Laboratory handout 5 Mode shapes and resonance In this handout, material and assignments marked as optional can be skipped when preparing for the lab, but may provide a useful
More informationFinal 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 informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationThe Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X
The Z-Transform For a phasor: X(k) = e jωk We have previously derived: Y = H(z)X That is, the output of the filter (Y(k)) is derived by multiplying the input signal (X(k)) by the transfer function (H(z)).
More informationDFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6
DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 22: April 10, 2018 Adaptive Filters Penn ESE 531 Spring 2018 Khanna Lecture Outline! Circular convolution as linear convolution with aliasing! Adaptive Filters Penn
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More informationProblem 1 (10 points)
y x CHEN 1703 - HOMEWORK 4 Submit your MATLAB solutions via the course web site. Be sure to include your name and UNID in your m-file. Submit each solution seperately. Also be sure to document your solutions
More informationECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet
ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems.
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationDesigning Information Devices and Systems I Fall 2018 Homework 3
Last Updated: 28-9-5 :8 EECS 6A Designing Information Devices and Systems I Fall 28 Homework 3 This homework is due September 4, 28, at 23:59. Self-grades are due September 8, 28, at 23:59. Submission
More informationIT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING IT6502 - DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A 1. What is a continuous and discrete time signal? Continuous
More informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 2026 Summer 2018 Problem Set #1 Assigned: May 14, 2018 Due: May 22, 2018 Reading: Chapter 1; App. A on Complex Numbers,
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
More informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationCE 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