Due dates are as mentioned above. Checkoff interviews for PS4 and PS5 will happen together between October 24 and 28, 2012.

Similar documents
6.02 Fall 2012 Lecture #11

6.02 Fall 2012 Lecture #10

Lecture 11 FIR Filters

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

LECTURE 5 Noise and ISI

Determine the Z transform (including the region of convergence) for each of the following signals:

LTI Models and Convolution

Lab 4: Quantization, Oversampling, and Noise Shaping

Massachusetts Institute of Technology

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

LECTURE 5 Noise and ISI

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

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

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

6.02 Practice Problems: Frequency Response of LTI Systems & Filters

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

Digital Signal Processing Lecture 4

6.003 Homework #6. Problems. Due at the beginning of recitation on October 19, 2011.

DEPARTMENT OF EECS MASSACHUSETTS INSTITUTE OF TECHNOLOGY. 6.02: Digital Communication Systems, Fall Quiz I. October 11, 2012

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

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

9 Forward-backward algorithm, sum-product on factor graphs

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

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

Discrete-Time Systems

Final Exam 14 May LAST Name FIRST Name Lab Time

EEL3135: Homework #4

16.36 Communication Systems Engineering

Module 3. Convolution. Aim

LAB 6: FIR Filter Design Summer 2011

ESE 531: Digital Signal Processing

Lecture 5 - Assembly Programming(II), Intro to Digital Filters

Convolutional Coding LECTURE Overview

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)

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

6.003: Signals and Systems

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

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

Designing Information Devices and Systems I Fall 2015 Anant Sahai, Ali Niknejad Final Exam. Exam location: RSF Fieldhouse, Back Left, last SID 6, 8, 9

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

!P x. !E x. Bad Things Happen to Good Signals Spring 2011 Lecture #6. Signal-to-Noise Ratio (SNR) Definition of Mean, Power, Energy ( ) 2.

channel of communication noise Each codeword has length 2, and all digits are either 0 or 1. Such codes are called Binary Codes.

CHAPTER 8 Viterbi Decoding of Convolutional Codes

VU Signal and Image Processing

Centre for Mathematical Sciences HT 2017 Mathematical Statistics. Study chapters 6.1, 6.2 and in the course book.

Chap 2. Discrete-Time Signals and Systems

EE123 Digital Signal Processing

2.161 Signal Processing: Continuous and Discrete Fall 2008

Shift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform

Designing Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Homework 11

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.

1. Quantization Signal to Noise Ratio (SNR).

6.01 Midterm 2 Spring 2011

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

Name: Student number:

Lecture 3 January 23

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

An overview of key ideas

Designing Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 12

CS 179: GPU Programming. Lecture 9 / Homework 3

EEO 401 Digital Signal Processing Prof. Mark Fowler

Lecture 4 Capacity of Wireless Channels

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

6.02 Fall 2012 Lecture #1

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

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

6.003 Homework #6 Solutions

Adaptive Systems Homework Assignment 1

EECE 2510 Circuits and Signals, Biomedical Applications Final Exam Section 3. Name:

9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise

NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00

Fourier Analysis and Spectral Representation of Signals

Digital Signal Processing. Midterm 2 Solutions

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Designing Information Devices and Systems I Spring 2018 Homework 11

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

Physical Layer and Coding

Digital Signal Processing. Midterm 1 Solution

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

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

Digital Filters Ying Sun

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips

EE123 Digital Signal Processing

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Multidimensional digital signal processing

Massachusetts Institute of Technology

Training Neural Networks Practical Issues

ECE Homework Set 2

Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Quiz II.

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

CS 179: GPU Programming. Lecture 9 / Homework 3

EECS 20N: Midterm 2 Solutions

Managing Uncertainty

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

BME 50500: Image and Signal Processing in Biomedicine. Lecture 5: Correlation and Power-Spectrum CCNY

ELEN E4810: Digital Signal Processing Topic 2: Time domain

Lecture 19 IIR Filters

Transcription:

Problem Set 5 Your answers will be graded by actual human beings (at least that's what we believe!), so don't limit your answers to machine-gradable responses. Some of the questions specifically ask for explanations; regardless, it's always a good idea to provide a short explanation for your answer. Before doing this PSet, please read Chapters 11 and 12 of the readings. Also attempt the Convolution and Frequency Response practice problems on this material. Due dates are as mentioned above. Checkoff interviews for PS4 and PS5 will happen together between October 24 and 28, 2012. Problem 1. Eye Diagrams Consider the following three eye diagrams generated by applying a random sequence of 200 bits, with 10 samples/bit, to three different causal LTI systems: 1

Eye Diagram A Eye Diagram B Eye Diagram C The unit sample responses for each of the three causal LTI systems are given below, in some order: 2

Unit-sample Response 1 Unit-sample Response 2 Unit-sample Response 3 S. For each of the channels 1, 2, and 3, determine the value of the step response at time n = 4 3

A. Which unit sample response goes with eye diagram A? B. Which unit sample response goes with eye diagram B? C. Which unit-sample response goes with eye diagram C? Problem 2. Suppose the only nonzero values of the input x[n] to a causal LTI system are: x[0] = 3 x[1] = 2 x[2] = 1 x[3] = -2 x[4] = -1 If the unit sample response of the system is h[n] = (1/3) n for n 0, what is the maximum value of the output y[n], and for what value of n does y[n] achieve its maximum? (Hint for how to do this easily: Sketch x[ ] and h[ ] and think about the "flip-slide-dot product" implementation of convolution.) Problem 3. Suppose the unit sample response of a causal LTI channel is given by h[k] = (1/2) k for k 4

0. The input to the channel is x[n], and the output is y[n]. A. Find the unit sample response g[ ] of a causal LTI filter that the receiver could use, such that applying the channel output y[n] to the input of this filter results in a filter output z[n] that equals the channel input x[n]. B. Write down the frequency responses H(Ω) and G(Ω). Problem 4. Consider a causal LTI channel with the unit sample response h[k] = (1/3) k for k 0. Assume the input is x[n] = cos(ω 0 n + π/4) for all n. A. Determine the frequency response H(Ω) of the channel. B. Find an expression for y[n] when Ω 0 = 0, and write down the value of y[3]. C. Find an expression for y[n] when Ω 0 = π, and write down the value of y[3]. 5

D. Find an expression for y[n] when Ω 0 = π/2, and write down the value of y[3]. Programming Tasks As in PSet 4, we will use the Audiocom communication system, which uses your computer's speakers to transmit signals, and your computer's microphone to receive signals. In this lab, we will explore the unit-step and unit-sample response of the "baseband-equivalent" channel. Reminder: The documentation for audiocom is available at http://audiocom602.blogspot.com. Task 1: Bypass Channel It will help us debug issues over the audio channel if we implement a bypass channel that simulates an LTI channel with delay, lag, and (additive Gaussian) noise. Go to bypass_channel.py, which provides a template class, BypassChannel. Notice that its init method takes three arguments. You already dealt with the first argument, noise, in PSet 4. Here, your task is, in addition, to use the specified lag and h to simulate their effects. Write xmit_and_recv: given the channel's unit-sample response, self.h, the number of samples of delay between transmitter and receiver, self.lag, and Gaussian noise, self.noise, return a numpy array in which each the input numpy array, tx_samples, is convolved with h, followed by the prepending by self.lag samples of value 0 volts, and finally a Gaussian random variable with zero-mean and variance self.noise added. Return the resulting numpy array. Upload your bypass_channel.py: Task 2: Eye diagrams In this task, we will be looking at the effects of noise and channel h on eye diagrams, as well as their effect on our ability to successfully decode messages sent across a channel. Before actually making any plots, we will make some changes to make sure we always see an eye diagram, regardless of whether we successfully decode the message. In receiver.py, add the following lines before the call to plot_hist: p.figure(1) 6

plot_eye(demod_samples,spb,'eye diagram') p.figure(2) Also uncomment lines 80 and 81 in graphs.py. All parts of this problem except 2.5 should be completed using the bypass channel. Task 2.1: Noise and Eyes With that out of the way, let's consider the effect of noise on our eye diagrams. Try sending 500 random bits across your bypass channel with a noise variance of 0.1: python sendrecv.py -b -g -n 200 -z 0.1 Now repeat the experiment with all parameters the same except noise variance; adjust it to be 0.3, and then 0.5. What effect does the noise variance have on the "openness" of the eye diagrams in this experiment? Why? Task 2.2: Noise and SPB You may have noticed in the previous lab that higher values of samples per bit generally allowed us to more accurately decode our received messages. Let's try keeping noise variance constant at 0.3, and adjusting samples per bit (specified by parameter -s). Try with spb values 16, 64, 256, and 1024. What effect does the number of samples per bit have on the "openness" of the eye diagrams in this experiment? Why? Task 2.3: h and Eyes In the previous two questions, we have looked at the effect of noise on our eye diagrams. Now we will consider the effect of h, the unit sample response of the channel. In this experiment, we will hold constant both the noise variance (at 0.1) and the samples per bit (at 64). First, let's try sending 200 random bits with the following channel h: -u "0.25 0.25 0.25 0.25" How long does it take the unit step response of a system with unit sample response [0.25,0.25,0.25,0.25] to converge to 1? 7

Now let's repeat the experiment with the following channel USR's (command line arguments have been reproduced to save you some typing): -u "0.5 0.5" -u "0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1" -u "0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05 0.05" What effect does the channel's USR have on the "openness" of the eye diagrams in this experiment? Why? Task 2.4: h and SPB In this section, we will hold noise variance and h constant, and change the number of samples per bit. Try running with the last USR from the previous step (0.05 0.05...), with samples per bit values of 8, 16, 32, 64, and 256. What effect does the number of samples per bit have on the "openness" of the eye diagrams in this experiment? Why? Task 2.5: The Real World Now try sending 200 random bits across the actual audio channel. Try this with a number of different values of samples per bit. What effect does the number of samples per bit have on the "openness" of the eye diagrams in this experiment? Why? 8

9

MIT OpenCourseWare http://ocw.mit.edu 6.02 Introduction to EECS II: Digital Communication Systems Fall 2012 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.