E&CE 358, Winter 2016: Solution #2. Prof. X. Shen

Similar documents
Random Processes Handout IV

Digital Transmission Methods S

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

Example: Bipolar NRZ (non-return-to-zero) signaling

Es e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0

ECE 650 Lecture #10 (was Part 1 & 2) D. van Alphen. D. van Alphen 1

5 Analog carrier modulation with noise

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems

X b s t w t t dt b E ( ) t dt

A Hilbert Space for Random Processes

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

DETECTION theory deals primarily with techniques for

Sample Problems for the 9th Quiz

Chapter 2 Signal Processing at Receivers: Detection Theory

EE Introduction to Digital Communications Homework 8 Solutions

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

Lecture 5: Likelihood ratio tests, Neyman-Pearson detectors, ROC curves, and sufficient statistics. 1 Executive summary

This examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

ρ = sin(2π ft) 2π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero.

CHAPTER 14. Based on the info about the scattering function we know that the multipath spread is T m =1ms, and the Doppler spread is B d =0.2 Hz.

Application of Matched Filter

EE 574 Detection and Estimation Theory Lecture Presentation 8

Digital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10

This examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

2. What are the tradeoffs among different measures of error (e.g. probability of false alarm, probability of miss, etc.)?

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

ECE Homework Set 3

Signal Design for Band-Limited Channels

Lecture 8: Signal Detection and Noise Assumption

Communication Theory Summary of Important Definitions and Results

= 4. e t/a dt (2) = 4ae t/a. = 4a a = 1 4. (4) + a 2 e +j2πft 2

CMSC 426 Problem Set 2

ECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process

16.584: Random (Stochastic) Processes

Module 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur

s o (t) = S(f)H(f; t)e j2πft df,

A First Course in Digital Communications

ECE 450 Homework #3. 1. Given the joint density function f XY (x,y) = 0.5 1<x<2, 2<y< <x<4, 2<y<3 0 else

1.17 : Consider a continuous-time system with input x(t) and output y(t) related by y(t) = x( sin(t)).

ECE302 Spring 2006 Practice Final Exam Solution May 4, Name: Score: /100

that efficiently utilizes the total available channel bandwidth W.

EE4304 C-term 2007: Lecture 17 Supplemental Slides

A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted.

UCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei)

3. ESTIMATION OF SIGNALS USING A LEAST SQUARES TECHNIQUE

ECE Homework Set 2

Modifying Voice Activity Detection in Low SNR by correction factors

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

Principles of Communications

7 The Waveform Channel

EECE 3620: Linear Time-Invariant Systems: Chapter 2

TSKS01 Digital Communication Lecture 1

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

Projects in Wireless Communication Lecture 1

Chapter 3 Convolution Representation

INFORMATION PROCESSING ABILITY OF BINARY DETECTORS AND BLOCK DECODERS. Michael A. Lexa and Don H. Johnson

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

ECE-340, Spring 2015 Review Questions

System Identification & Parameter Estimation

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

CONVOLUTION & PRODUCT THEOREMS FOR FRFT CHAPTER INTRODUCTION [45]

Data Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.

FINAL EXAM: 3:30-5:30pm

ECE 541 Stochastic Signals and Systems Problem Set 11 Solution

2A1H Time-Frequency Analysis II

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

Communication Systems Lecture 21, 22. Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University

ECE531 Screencast 9.2: N-P Detection with an Infinite Number of Possible Observations

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Introduction to Statistical Inference

Digital Communications

Q3. Derive the Wiener filter (non-causal) for a stationary process with given spectral characteristics

ECE 3620: Laplace Transforms: Chapter 3:

Computing Probability of Symbol Error

ECE 564/645 - Digital Communications, Spring 2018 Midterm Exam #1 March 22nd, 7:00-9:00pm Marston 220

Lecture 9. PMTs and Laser Noise. Lecture 9. Photon Counting. Photomultiplier Tubes (PMTs) Laser Phase Noise. Relative Intensity

Massachusetts Institute of Technology

Digital Communications

13. Power Spectrum. For a deterministic signal x(t), the spectrum is well defined: If represents its Fourier transform, i.e., if.

Fourier Analysis Linear transformations and lters. 3. Fourier Analysis. Alex Sheremet. April 11, 2007

Chapter 5 Random Variables and Processes

Square Root Raised Cosine Filter

Multi User Detection I

Signals and Spectra - Review

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

Statistical signal processing

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

Properties of the Autocorrelation Function

Now identified: Noise sources Amplifier components and basic design How to achieve best signal to noise?

EE456 Digital Communications

2.1 Basic Concepts Basic operations on signals Classication of signals

ECE531 Homework Assignment Number 2

Detection and Estimation Theory

MAE294B/SIOC203B: Methods in Applied Mechanics Winter Quarter sgls/mae294b Solution IV

ECE531: Principles of Detection and Estimation Course Introduction

Chapter [4] "Operations on a Single Random Variable"

Signal Detection Basics - CFAR

Modulation & Coding for the Gaussian Channel

Recipes for the Linear Analysis of EEG and applications

Transcription:

E&CE 358, Winter 16: Solution # Prof. X. Shen Email: xshen@bbcr.uwaterloo.ca

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 Problem 1 The signal g(t = e t, t T is corrupted by additive white Gaussian noise with zero mean and power spectral density N / watts/hz. The optimum detector is a matched filter. (a Find and sketch the impulse response of the filter which is matched to the signal g(t. (b Derive an expression for the maximum output signal-to-noise ratio (SNR and express it in terms of the parameters, T and N. (c Consider the transmission of either s (t = g(t or s 1 (t = every T second interval, with equal probability, over a zero mean additive white Gaussian noise channel with power spectral density N / watts/hz. Sketch the pdf of the decision variable corresponding to s (t and s 1 (t sent, and derive the probability of error in making the decision as to whether s (t or s 1 (t was sent. ANSWER: g (t x(t t g t = e (, t T n(t N mn =, S n ( f = w / Hz a. Impulse response of the filter which is matched to the signal g(t is h(t = g(t t = { e (T t, t T, otherwise. g (t h(t e t e t b. f(t = g(t h(t = g(τh(t τdτ Problem 1 continued on next page... Page 1 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 (continued g (t t T h( t τ τ τ f(t = t e (τ e [T (t τ] dτ = 1 [e (τ t (t+t e ] g (t T t T h( t τ τ τ f(t = t T For other values of t, f(t = e (τ e [T (t τ] dτ = 1 [e (t τ (3T e t] f (t E S t The average noise power at the output of the matched filter is E[N (t] = = N S n (fdf = where E S is Energy of the signal g(t. E s = G(f df = H(f df = N S n (f H(f df = g (tdt = G(f df = N E s N H(f df e t dt = 1 (1 e T Problem 1 continued on next page... Page of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 (continued n (t n h(t H ( f N S n ( f = S ( f = S ( f H ( n f n Therefore, the signal-to-noise ratio at the receiver output for t T is (SNR = f (t E[n (t] = Since f(t achieves its maximum value at t = T with f (t N E s f(t = 1 (1 e T = E s The (SNR,max achieves its maximum value at t = T, which is (SNR,max = f (T E[n (t] = c. Transmission system E s N = E s = 1 E s N N (1 e T = 1 e T N φ, S S i (t i =, 1 = g, t T 1 1, S =, t T 1 φ n(t h(t N R n ( τ = δ ( τ If S ϕ = g(t was sent, then the decision variable y(t will be i = S, i + n y, i y(t = S,ϕ (T + n (T = E s + n (T S t = T y(t = S DD * h( t n = n( t * h( t where n (T is a Gaussian R.V. with mean E[n (T ] = and variance E[n (t] = N E s Therefore, y(t is also Gaussian distributed with mean E[y(T ] = E s and variance So, E[(y(T E s ] = V ar[n (T ] = N E s y(t N(E s, N E s If S 1 (t = was sent, then the decision variable y(t will be y(t = S,1 (T + n (T = + n (T i Problem 1 continued on next page... Page 3 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 (continued Therefore, y(t N(, N E s The conditional pdf of the decision variable y(t given that S ϕ (t = g(t was sent and the conditional pdf of the decision variable given that S 1 (t = was sent are shown below. Decision threshold: y(t = E s / Decision rule: If y(t E s /, then S ϕ (t = g(t was sent If y(t < E /, then S 1 (t = was sent Error event: y(t < E s /, given that S ϕ (t = g(t was sent y(t E s /, given that S 1 (t = was sent s 1 s φ ( y f y ( T S1 ( y f y ( T S E s Es So, the probability of error is P e = P (y(t < E s / S ϕ (t Pr(S ϕ (t sent + P (y(t E s / S 1 (t Pr(S 1 (t sent [ = 1 Es/ 1 exp [ (y E s ] ] ] 1 dy + exp [ y dy πes N E s N E s / πes N E s N = 1 1 E s N exp ( v dv + 1 exp ( u du π π Es N [ = 1 1 exp ( v dv + 1 ] exp ( u du π Es N π Es N [ ] = 1 Q( Es N + Q( Es N = Q( Es N Problem The purpose of a radar system is basically to detect the presence of a target, and to extract useful information about the target. Suppose that in such a system, hypothesis H is that there is no target present, so that the received signal x(t = w(t, where w(t is white Gaussian noise with power spectral density N /. For hypothesis H 1, a target is present, and x(t = w(t + s(t, where s(t is an echo produced by the target. Assumed that s(t is completely known. Problem continued on next page... Page 4 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem (continued (a Determine the structure of the optimal receiver. (b Evaluate the probability of false alarm defined as the probability that the receiver decides a target is present when it is not. (c Evaluate the probability of detection defined as the probability that the receiver decides a target is present when it it. (d Given that i the cost of a false alarm is the same as that of failing to detect a target when it is present, and ii the probability that there is a target is.1, determine the optimal decision threshold for the receiver. ANSWER: a. Optimal Receive Structure S1( t = S S = x(t h = S ( T t u = y(t t = T y(t S (t / w(t Let u = y(t be the decision variable The mean is The variance is where E s = S (τdτ = N E[u] = µ 1 = E[u S(t sent] = µ = E[u sent] = x(τ[s 1 (τ S (τ]dτ [S 1 (τ S (τ] dτ = N S(τ[S(τ ]dτ = E s [S(τ ]dτ = S (τdτ = N E s f u u ( ( u S f u S ES u Decision threshold: Let be the decision threshold, depends on E s and the probability that a target is present or not. Decision rule: if u, choose S(t Problem continued on next page... Page 5 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem (continued if u <, choose b. c. P F A = Pr{False Alarm} = Pr{ Receiver decides that a target is present when there is actually no target} = Pr{u no target} ] 1 (u = exp [ π du = 1 exp π P det = Pr{Detection} ] ( [ x x dx = Q = Q N E s = Pr{ Receiver decides that a target is present when there is a target} = Pr{u target present} 1 = exp [ (u E s ] π du = 1 exp π = 1 π Es exp ] ( [ x x dx = Q ( x dx = Q = Q E s N E s ( Es = Q E s N E s d. Find the decision threshold such that the average cost of the radar system is minimized. Let Y = Error event, X = no target, X = target present Then, Average Cost P (Y = P (Y XP (X + P (Y XP (X = P F A P (x + P fail P (x = (cost of false alarm P F A Pr{ no target} + (cost of failure to detect P fail Pr{targetpresent} where P F A = Pr{False Alarm} Pr{ target present} =.1 Pr{ no target} = 1.1 =.9 P fail = Pr{ Failing to detect a target} = 1 Pr{ Detection} Let cost of false alarm = cost of failure to detect = c Average cost = c P F A.9 + c P fail.1 Problem continued on next page... Page 6 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem (continued Let the decision threshold, as mentioned in part a be = βe s, where.5 β 1, because Pr{ no target} > Pr{ target present} From part b ( Es P F A = Q β From part c P fail = 1 P det = 1 Q N βe s E s N E s Therefore, the average cost is { ( Es Average cost = c.9 Q β N = Q ( (1 β E s N ( +.1 Q (1 β E } s N Find the value of β which minimizes the above cost function and use that value of β (let it be β min to calculate the optimal threshold (β min E s for the receiver. We cannot solve for β min, if we don t know the SNR E s /N for this system. Therefore, we consider solving for β min for a particular SNR. For example, for an SNR = 1 db The cost function is Method A : Trial and error 1 log E s N = 1, E s N = 1 cost =.9Q(β +.1Q((1 β =.9Q(4.5β +.1Q(4.5(1 β cost β=.5 =.9Q(4.5.5 +.1Q(4.5.5 =.9Q(.5 +.1Q(4.5(.5 = Q(.5 =.1 cost β=1 =.9Q(4.5 1 +.1Q(4.5 =.9Q(4.5 +.1Q( =.9 +.1.5 =.5 cost β=.75 =.9Q(4.5.75 +.1Q(.5 4.5 =.9Q(3.375 +.1Q(1.15 =.333 +.8697 =.873 cost β=.6 =.9Q(4.5.6 +.1Q(.4 4.5 =.9Q(.7 +.1Q(1.8 =.313 +.3593 =.6716 Problem continued on next page... Page 7 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem (continued Therefore, Cost is minimum when β =.6 So, the optimum decision threshold at.6e s. Method B: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % cost function for Es/N = 1 db % % Pr{no target} =.9 Pr{target} =.1 % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% cost β=.6 =.9Q(4.5.6 +.1Q(.4 4.5 =.9Q(.7 +.1Q(1.8 =.313 +.3593 =.6716 cost β=.8 =.9Q(4.5.8 +.1Q(. 4.5 =.9Q(3.6 +.1Q(.9 =.144 +.1846 =.1855 global s global ebno global a min_beta =.; max_beta =.; step =.5; B = []; dbebno = 1; ebno = 1^(dbebno/1; a = sqrt(*ebno; i = 1; for s=min_beta:step:max_beta B(i=.9*.5*erfc(a*s/sqrt(+.1*.5*erfc(a*(1-s/sqrt(; i = i+1; end s = min_beta:step:max_beta; plot(s,b; xlabel( Beta ; ylabel( Cost ; grid; %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % cost function for Es/N = 1 db % % Pr{no target} =.5 Pr{target} =.5 % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% global s global ebno global a Problem continued on next page... Page 8 of 9

Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem (continued min_beta =.; max_beta =.; step =.5; B = []; dbebno = 1; ebno = 1^(dbebno/1; a = sqrt(*ebno; i = 1; for s=min_beta:step:max_beta B(i=.5*.5*erfc(a*s/sqrt(+.5*.5*erfc(a*(1-s/sqrt(; i = i+1; end s = min_beta:step:max_beta; plot(s,b; xlabel( Beta ; ylabel( Cost ; grid;.5.5.45.45.4.4.35.35.3.3 Cost.5 Cost.5...15.15.1.1.5.5..4.6.8 1 1. 1.4 1.6 1.8 Beta..4.6.8 1 1. 1.4 1.6 1.8 Beta (a cost function for Es/N = 1 db Pr{no target} =.9 Pr{target} =.1 (b cost function for Es/N = 1 db Pr{no target} =.5 Pr{target} =.5 Page 9 of 9