Test 2 Electrical Engineering Bachelor Module 8 Signal Processing and Communications

Similar documents
Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

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

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

Communications and Signal Processing Spring 2017 MSE Exam

Module 3. Convolution. Aim

SRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS

MA EXAM 3 Form A November 12, You must use a #2 pencil on the mark sense sheet (answer sheet).

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

Grades will be determined by the correctness of your answers (explanations are not required).

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

P 1.5 X 4.5 / X 2 and (iii) The smallest value of n for

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

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

Computer Engineering 4TL4: Digital Signal Processing

Centre for Mathematical Sciences HT 2017 Mathematical Statistics

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

Advanced Signals and Systems

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

Coding for Digital Communication and Beyond Fall 2013 Anant Sahai MT 1

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

E : Lecture 1 Introduction

Name of the Student: Problems on Discrete & Continuous R.Vs

EEO 401 Digital Signal Processing Prof. Mark Fowler

Discrete-time signals and systems

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

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

EECS 123 Digital Signal Processing University of California, Berkeley: Fall 2007 Gastpar November 7, Exam 2

ESE 531: Digital Signal Processing

Final Exam January 31, Solutions

6.003 (Fall 2011) Quiz #3 November 16, 2011

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

MA EXAM 1 Green February 8, You must use a #2 pencil on the mark sense sheet (answer sheet).

EE538 Digital Signal Processing I Session 13 Exam 1 Live: Wed., Sept. 18, Cover Sheet

ELEN 4810 Midterm Exam

MA Exam 1 Fall 2015 VERSION 01

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

MA EXAM 3 Green April 11, You must use a #2 pencil on the mark sense sheet (answer sheet).

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes

University Question Paper Solution

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

Problem Value Score No/Wrong Rec

ECE 636: Systems identification

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Introduction to Digital Signal Processing

R13 SET - 1

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

EE482: Digital Signal Processing Applications

Quiz. Good luck! Signals & Systems ( ) Number of Problems: 19. Number of Points: 19. Permitted aids:

MAT 3379 (Winter 2016) FINAL EXAM (PRACTICE)

Grades will be determined by the correctness of your answers (explanations are not required).

Lecture 11 FIR Filters

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

ESE 531: Digital Signal Processing

MA EXAM 3 INSTRUCTIONS VERSION 01 April 18, Section # and recitation time

Review of Discrete-Time System

EE482: Digital Signal Processing Applications

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing

UCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011

Name of the Student: Problems on Discrete & Continuous R.Vs

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172.

Name of the Student: Problems on Discrete & Continuous R.Vs

ECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet

TSKS01 Digital Communication Lecture 1

MA FINAL EXAM Green December 16, You must use a #2 pencil on the mark sense sheet (answer sheet).

ECGR4124 Digital Signal Processing Midterm Spring 2010

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

MA EXAM 3 INSTRUCTIONS VERSION 01 April 14, Section # and recitation time

MA 161 EXAM 3 GREEN November 14, You must use a #2 pencil on the scantron sheet (answer sheet).

Name (printed): Signature:

Name (printed): Signature:

CSE548, AMS542: Analysis of Algorithms, Fall 2016 Date: Nov 30. Final In-Class Exam. ( 7:05 PM 8:20 PM : 75 Minutes )

3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE

CSE 546 Final Exam, Autumn 2013

Introduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009

EE 278 October 26, 2017 Statistical Signal Processing Handout #12 EE278 Midterm Exam

EE 16B Final, December 13, Name: SID #:

Solutions. Number of Problems: 10

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

STUDENT NAME: STUDENT SIGNATURE: STUDENT ID NUMBER: SECTION NUMBER RECITATION INSTRUCTOR:

Name of the Student: Problems on Discrete & Continuous R.Vs

SPECTRUM. Deterministic Signals with Finite Energy (l 2 ) Deterministic Signals with Infinite Energy N 1. n=0. N N X N(f) 2

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

Lecture 7 Random Signal Analysis

Math 164-1: Optimization Instructor: Alpár R. Mészáros

MA EXAM 3 Form A April 16, You must use a #2 pencil on the mark sense sheet (answer sheet).

MA EXAM 2 INSTRUCTIONS VERSION 01 March 9, Section # and recitation time

Unit 1 Maths Methods (CAS) Exam 2011

STUDENT NAME: STUDENT SIGNATURE: STUDENT ID NUMBER: SECTION NUMBER RECITATION INSTRUCTOR:

EE 313 Linear Signals & Systems (Fall 2018) Solution Set for Homework #7 on Infinite Impulse Response (IIR) Filters CORRECTED

Chirp Transform for FFT

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

Question Paper Code : AEC11T02

Lecture - 30 Stationary Processes

ESE 531: Digital Signal Processing

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

Transcription:

Test 2 Electrical Engineering Bachelor Module 8 Signal Processing and Communications (201400432) Tuesday May 26, 2015, 14:00-17:00h This test consists of three parts, corresponding to the three courses in Theme 2: Part 1: Probability Theory; Part II: Random Signals and Noise; Part III: Digital Signal Processing. Problems in different parts can be solved independently. Grading: Part I and Part II each have a maximum score of 25 points, whereas Part III has a maximum score of 40 points; You earn 10 additional points by obeying all test rules outlined below and on the next page. The grade for the test is the total number of points divided by 10. Material to use during the test: All printed and handwritten material can be consulted during the test, including books, handouts, printed lecture slides, written notes, summaries and solutions. A simple pocket calculator can be used. Graphical and/ or programmable calculators, laptop computers, mobile phones, tablets, PDAs and any other electronic devices with wireless communication capability are not allowed on your table. See next page 1

Answering: Write down answers corresponding to different test parts (I, II and III) on separate answer papers. Fill out your full name and student number on every answer paper before writing down your answers. In case you need more than one answer paper per test part, complete all four pages of your first paper before proceeding to a new one. Possibly ask the exam supervisor for more papers. Although the problems are formulated in English, you can write your answers in Dutch. Please write in black or blue, using a pen. Do not use a pencil. Motivate all your answers. End of the test: No one leaves during the last 15 minutes of the test (i.e. after 16:45h). When it is 17:00h, do not leave your seat until your answer papers have been collected. Students with disabilities can use 45 minutes (25%) more time, provided that they show their pass and sit in the front row. Hand in at least one answer paper. Any remaining papers can be taken home, including this question paper. Once your answer papers have been collected, leave the room quickly and quietly. Good luck! See next page for Part I 2

Part I - Probability Theory 1. A shop in second-hand electronic equipment sells three types of microphones. Type i microphones are working properly with probability Pi, where p 1 = 0.8, p 2 = 0.9 and p 3 = 1. Arjan buys a microphone at random, meaning that with probability 1/3 he buys a type i microphone, i = 1, 2, 3. Define and use notation for relevant event(s) and/or random variable(s) to find the following. a. The probability that the purchased microphone is working properly. b. The probability that the purchased microphone is of type 3 when it turns out to be working properly. 2. Let Xn be the number of typos (errors) on page n of a certain set of lecture notes. The simultaneous probability distribution of the numbers of typos on pages 1 and 2 is given by e-2 P(X1 = i, X2 = j) = -. 1 -. 1, i, j = 0, 1, 2,... L..J. a. Show that the distribution of X 1 is Poisson with expectation 1. b. Are X 1 and X 2 mutually independent? c. Determine the probability distribution of X 1 + X 2. 3. Suppose a researcher takes some time measurements X andy (in seconds), where X and Y have a joint density function: f(x, y) = 2x + 2y for 0 :::; x :::; 1 and 0 :::; y :::; x, while f(x, y) = 0 elsewhere. a. Find the marginal probability density of X. b. Knowing that the expected value of Y is 5/12 (so you do not need to compute this), find the covariance of X andy. What can be concluded from this value? c. What is the probability that the sum of X andy is less than 1 second? Scores per problem: 1 2 3 Totaal alb alblc alb _I c 313 31313 31413 25 End of Part I - See next page for Part II 3

Part II- Random Signals and Noise This part consists of 5 related problems. Consider a random signals X(t) that is given by X(t) = sin(27rfot + 8), where the frequency fo is a positive deterministic constant, and the phase 8 is a random variable that is uniformly distributed between 0 and 1r. 1. [3 points] Plot two possible realizations of X(t). Clearly mark the axes. 2. [3 points] Is X(t) first-order stationary? Motivate your answer. Suppose that the signal X(t) is passed through a squaring device, resulting in a random signal Y(t) = X 2 (t). 3. [8 points] Is Y(t) wide-sense stationary? Motivate your answer. 4. [4 points] Show that the power spectral density of Y(t) is given by Sy(J) = 1 16 15(1 + 2fo) + ~15(1) + 1 16 15(1-2fo). Now suppose that Y(t) is passed through a linear time-invariant filter with impulse response f h(t) = 0 < t < 1/ f JO' - - JO' { 0, elsewhere, resulting in an output signal Z(t). 5. [7 points] Derive the autocorrelation function of Z(t). End of Part II - See next page for Part III 4

Part III - Digital Signal Processing Exercise 1 DTFT [5 points] Prove that if y[n] = x[-n] and :r[n] +--+ X(ei 0 ), then y[n] +--+ X(e-i 0 ) Exercise 2 DTFT [5 points] Prove that, for lal < 1, lnl 1- a2 a +--+ 1-2a cos(s1) + a 2 Exercise 3 DFT [5 points] Assume that x[n], n = 0,..., N- 1 is real-valued and x[n] +--+ X*[k] denote the complex conjugate of X[k]. Prove that X[k]. Let X*[k] = X[N- k], k = 0,..., N- 1. Hint: Use X[-k] = X[N- k]. Exercise 4 Filter design [5 points] Consider the impulse response h[n], n = 0,..., AI of an FIR lowpass filter with a cutoff frequency Slc. Explain how this impulse response can be modified to that of a high-pass filter with a cutoff frequency Jr- Slc. Exercise 5 Spectral DSP [10 points total] Consider an overlap-add implementation of a digital filter with impulse response h[n], n = 0,..., K -1. The signal is divided into segments xi of length N, that are processed in the DFT (FFT) domain separately. After processing the resulting segments Yi are added to reconstruct the filtered output y[n]. (a) [5 points] Explain why the segments xi have to be extended (padded) with zeros. What is the minimum number of zeros? (b) [5 points] \Vhat is the additional delay of this overlap add-implementation? Exercise 6 Sampling-rate conversion [5 points] Explain why the lowpass filter that is used after zero insertion, i.e. the block t K, in a K-times up has a gain K. Exercise 7 Sampling-rate conversion [5 points] Why is it important that the transition band of the lowpass filter used in a K-times down sampler is fully in the frequency range [0, f<: )? End of Test 5