4 Pages

HW05

Course: ECE 461, Fall 2009
School: Lake County
Rating:
 
 
 
 
 

Word Count: 1651

Document Preview

of University Illinois 1.(a) Problem Set #5: Solutions Page 1 of 4 ECE 361 Spring 2001 The signals are illustrated below for the two cases 0 T/2 and T/2 < T. They are obviously orthogonal if = 0 or = T. They are not antipodal for any . 0 T/2, T/2 T s0(t) s0(t) s1(t) T s1(t) T h(t) h(t) (b) Almost by inspection (see figure above), E 0 = A2 , E 1 = A2 T, and A2 , s0 , s 1 = 2 A...

Register Now

Unformatted Document Excerpt

Coursehero >> Illinois >> Lake County >> ECE 461

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
of University Illinois 1.(a) Problem Set #5: Solutions Page 1 of 4 ECE 361 Spring 2001 The signals are illustrated below for the two cases 0 T/2 and T/2 < T. They are obviously orthogonal if = 0 or = T. They are not antipodal for any . 0 T/2, T/2 T s0(t) s0(t) s1(t) T s1(t) T h(t) h(t) (b) Almost by inspection (see figure above), E 0 = A2 , E 1 = A2 T, and A2 , s0 , s 1 = 2 A (T), A2 (T), if 0 T/2, if 0 T/2, Hence, E0 + E 1 2s0 , s 1 = 2 if T/2 T. A (3T), if T/2 T, and the optimum minimax error probability achievable is (c) (d) A2 (T ) A2 (3 T) if 0 T/2, and Q 2N0 2N0 if T/2 T. E0 + E 1 2s0 , s 1 decreases linearly from A2 T at = 0 to A2 T/2 at = T/2, and then increases linearly to 2A 2 T at = T. Hence, the least value of the minimax error probability occurs when = T. The signals are orthogonal (with E0 + E 1 = A2 T) in this case. The signals are also orthogonal if = 0 but E0 + E 1 is only A 2 T/2 in this case. Thus, = 0 gives a local minimum but not the global minimum for the minimax error probability. Similarly, the maximum error probability occurs if = T/2. Note that these results cannot be derived by the usual method of finding where the derivative is zero (why not?), but are obvious if you sketch (SNR)2 as a function of . I take h(t) = [s0 (T t) s1 (T t)]. The impulse response functions are as shown above. For this choice of matched lter response, the minimax threshold can be expressed as (E0 E 1 )/2. Thus, we have Q (e) A2 (T )/2, if 0 T/2, m = (E0 E 1 )/2 = 2 if T/2 T. +A (T )/2, The filter outputs are as sketched on the next page. If 0 T / 2 , then T 0 = 3T/2 at which time, ^0 (T0 ) = 0, ^1 (T0 ) = AT/2 and the minimax threshold s s is AT/4. Notice that this will also hold if = 0 (in which case ^0 (t) = 0 for all t.) Since the noise s ^ (T )^ (T ) N N T s s AT/4 variance is 2 = 0 h2 (t)dt = 0 , the minimax error probability is Q 0 0 1 0 = Q 2 2 2 N0 T/2 = Q A2 T 8N0 independent of the value of . In contrast, the optimum receiver has P = Q e Q A2 T 2N0 A2 T at = T/2. 4N0 Note that at = 0, the optimum receiver has a 6 dB advantage over the (simpler?) nonoptimum receiver (in terms of the value of A required to achieve a given error probability). The improvement decreases to a 3dB advantage at = T/2. The optimum receiver can also use a sampling time of T0 = T whereas the at = 0 increasing to University of Illinois Problem Set #5: Solutions Page 2 of 4 ECE 361 Spring 2001 nonoptimum receiver uses a sampling time of 3T/2 (i.e. has a greater delay). 0 T/2, T/2 T s0(t) s0(t) s1(t) T s1(t) T + 2 2 + If T / 2 T , any T 0 , T T 0 3T/2, is an optimum sampling time! Choosing T0 = T, ^0 (T0 ) = A, ^1 (T0 ) = 0, and the minimax threshold is A/2. s s The minimax error probability is Q This has value A = Q 2 N0 T/2 A2 2 2N0 T . at = T. In comparison, the Q A2 T 8N0 at = T/2 decreasing to Q A2 T 2N0 A2 T A2 T at = T/2 decreasing to Q at = T. Thus, the 4N0 N0 optimum receiver has a 3dB advantage over the nonoptimum receiver for all , T/2 T. optimum receiver achieves Q P 0 P and P 1 P. Under these constraints, which of the above signal sets will give the smallest error probability? and what is this smallest error probability? E0 + E 1 2 s0 ,s 1 The signals are equally likely, and the error probability is Q 2N0 . We can find the values of P0 = E0 /T, P 1 = E1 /T, P = (P 0 + P 1 )/2, and E0 + E 1 - 2s0 ,s 1 for each of the signal sets. The results are as follows: P0 P1 P s 0 , s 1 E 0 + E 1 - 2 s 0 , s 1 2 2 2 2T I: ( 3/2) (2 3) 2 T = (2 3)PT II: 2 2 2 0 22 T = 2PT III: 2 2 2 2 T 4 2 T = 4PT IV: 2 2 /2 32 /4 2 T/ 2 2 T(3 + 2 2)/2 = 2PT(3+2 2)/3 Clearly, 2 = 2 = 2 = 32 /4 = P. Since 2 3 < 2 < 2(3+2 2)/3 < 4, Set III has the smallest error 2P T probability which is Q . N0 Now we have 2 = 2 = 2 = 2 = P. As in part (a), set III has E0 + E 1 2s0 ,s 1 = 4PT, while set IV 2. Set Set Set Set (a) (b) University of Illinois Problem Set #5: Solutions Page 3 of 4 ECE 361 Spring 2001 now has E 0 + E 1 2s0 ,s 1 = PT(3+2 2)/3 < 2PT < 4PT. Hence, Set III has the smallest error 2PT probability which is Q . N0 (c) We now must equate the maximum amplitudes 3, 2, 2 , and respectively to A. The values of E0 + E 1 2s0 ,s 1 are (2 3)A2 T/3, A 2 T, 2A2 T, and [(3+2 2)/2]A2 T respectively. Hence, set IV has A2 T(3+2 2) . 4N0 The threshold is zero if E0 = E1 . Sets I-III satisfy the condition. the least error probability which is Q (d) 3.(a) Since t 3 is an odd function while 0 and 2 are even functions, it follows that c3,0 = t3 ,0 = 0 = c3 , 2 = 1 t3 ,2 . c3 , 1 = (b) (c) -1 1 2 Since ||t3 ||2 = t 6 dt = 7 , the MMSE is ||t3 ||2 (c 3,i )2 = 2/7 6/25 = 8/175. -1 3 = (3/5)t if t = 0 or t = 3/5. Geez, that was easy! t t3 3 tdt = 2 -1 3 t5 6 6 = 5 . Hence, the MMSE representation of t3 is 5 2 5 1 | 3 3 t = t. 2 5 3 = t 3 (3/5)t, and ||3 ||2 = 8/175. Hence, 3 (t) = [t3 - (3/5)t]/ 8/175 = 7/2(1/2)[5t3 - The 3t]. reason for the peculiar way of writing the result is that the Legendre polynomial P 3 (t) is commonly defined as (1/2)[5t3 - 3t]. More generally, Pn (t) = polynomials. The orthonormal polynomial is n (t) = [(2n+1)/2]1/2 P n (t). 1 dn 2 n nn! dtn(t -1) . 2 The Pn s are orthogonal (but not orthonormal) (d)(e) We already found c3,0 = c3,2 = 0, and c3,1 = 6/5. It should be obvious from all of the above (and from the answer to Problem 2(c)!) that c3,3 = 8/175 (f) ||^0 ||2 = ||t3 ||2 = t 6 dt = 2 , so that we set 0 (t) = 7/2t3 . Since ^1 (t) = t2 , and t2 , t 3 = 0, we get s s 7 -1 1 immediately that 1 = ^1 (t) = t2 with ||1 ||2 = 2/5. Hence 1 (t) = s 1 5/2t2 . Next, ^2 (t) = t is orthogonal to s t2 while c 2,0 = -1 t ( 7/2)t3 dt = 7/2(2/5) = 14/5. Hence, 2 = t (7/5)t3 , ||2 ||2 = ||t||2 14/25 3/2(1/2)[5t7t3 ]. Finally, ^3 (t) = 1 s 1 (why?) = (2/3) 14/25 = 8/75. Thus, 2 (t) = [t (7/5)t 3 ]/ 8/75 = is orthogonal to t3 and t, while c 3,1 = -1 2 = ||1||2 - 10/9 = 8/9, and hence (t) = (1 5t 2 /3 2)/ 8/9 = ||3 || 3 1 ( 5/2)t2 dt = 10/3 giving 3 = 1 - 5t2 /3 2. 1/2(1/2)[3 5t 2 ]. Next, some 50 (t)]/3, algebra shows that 0 (t) = 7/2t3 2 (t) = = [23 (t) + 211 (t)]/5, 1 (t) = 5/2t2 = [22 (t) + 3/2(1/2)[5t 7t3 ] = [ 213 (t) + 21 (t)]/5, (g) 3 (t) = 1/2(1/2)[3 5t 2 ] = [ 52 (t) + 2 0 (t)]/3. Thus, [0 (t), 1 (t), 2 (t), 3 (t)] = [0 (t), 1 (t), 2 (t), 3 (t)]A 0 2/3 5/3 0 2/5 0 0 where A = 21/5 . Note that ATA = I, the identity matrix (why?). 0 0 2/3 5/3 2/5 0 21/5 0 Since the 's and 's span the same four dimensional space (of all polynomials of degree 3 or less), the approximation of any s(t) is the same function but expressed in different bases. For example, t4 2/(5 2)0 (t) + 8/(7 10)2 (t) = 6t2 /7 3/35 and t4 ( 10/7)1 (t) - (4/(35 2))3 (t) = 6t2 /7 3/35 also. Obviously, the MMSE is the same in either University of Illinois Problem Set #5: Solutions Page 4 of 4 ECE 361 Spring 2001 case. To describe the relationship between the two representations,write b = [b0 , b 1 , b 2 , b 3 ], c = [c0 , c 1 , c 2 , c 3 ], = [0 (t), 1 (t), 2 (t), 3 (t)] and = [0 (t), 1 (t), 2 (t), 3 (t)] as vectors. Then the two approximations are bT and cT. Since = A, we get that cT = AcT= bT, where bT = AcT. Note that A TAcT = ATbT, i.e. cT = ATbT or c = bA. Exercise: verify that [0, 2/(5 2), 0, 8/(7 10)]A = [0, 4.(a) 10/7, 0, 4/(35 2)] (b) (c) (d) (e) (f) (g) (h) (i) The nearest point must lie on the straight line through (0,0) and (+1,+1) and hence must be of the form (x,x) where (x1)2 + (x1) 2 = 1 2 . It follows that x = 1 1/ 2. The nearest points on the other circles are (x,x), (x,x), and (x,x). The small circle passes through the above four points and thus has radius given by r 2 = x 2 + x 2 = 3 2 2 = ( 2 1) 2 . Hence, r = 2 1 < 1. The nearest point must lie on the straight line through (0,0,0) and (+1,+1,+1) and hence must be of the form (x,x,x) where (x1)2 + (x1) 2 + (x1) 2 = 1 2 . It follows that x = 1 1/ 3. The other nearest points on the other circles are of the form (x,x,x). The ...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Whitman - M - 300
MATH 300, Second Exam REVIEW QUESTIONSYou should also look at the supplementary exercises for Chapter 4, problems 1-111. Let u = and u + v.2 1and v =-2 1, and A =4 53 3. Let S be the parallelegram with vertices at 0, u, v, Compute the area of S.
Penn State - ME - 360
ME 360 Fall 2008 HW14Name _Chris Allen's first job at ABC Corporation was to analyze stress on bolts used in a new lawn mower being developed for the consumer market and recommend a vendor to supply 100,000 bolts per year. Based on conservative estimate
VCU - PDFS - 20012
36School of the Arts APPM ARTHm Sum er2001ARTF 104 DESIGN FUNDAMENTALS11820 001 (2) MTWR 0100PM 0250PM STAFF Jun 18 Jul 26 (6 wks) FTERR 0202School of the ArtsApplied MusicPrivate lessons in most instruments are available to those who read music a
Lake County - ECE - 313
UNIVERSITY OF ILLINOIS, URBANA-CHAMPAIGN Department of Electrical and Computer Engineering ECE 313: Probability with Engineering Applications-Fall 2003 Problem Set 4: Mean, Variance, and Estimation Issued: September 19, 2003 Reading Assignments: Ross, Cha
CSU Fullerton - ISDS - 361
Chapter 1010.1 A point estimator is a single value; an interval estimator is a range of values.10.2 An unbiased estimator of a parameter is an estimator whose expected value equals the parameter.10.310.410.5 An unbiased estimator is consistent if the
Sanford-Brown Institute - CSCI - 2950
A Distributed Filtering Architecture for Multimedia SensorsSuman Nath, Yan Ke, Phillip B. Gibbons, Brad Karp, and Srinivasan SeshanIRP-TR-04-16 August, 2004INFORMATION IN THIS DOCUMENT IS PROVIDED IN CONNECTION WITH INTEL PRODUCTS. NO LICENSE, EXPRESS
Washington - M - 112
MATH 112 C Exam II - Version 1 February 26, 2004Name Student ID # Section1 2 3 Total16 17 17 50 You are allowed to use a calculator, a ruler, and one sheet of handwritten notes. Please check that your exam contains three problems on three pages. Pleas
Iowa State - COMS - 541
CS 541 Lecture -*- Outline -*-* Structural operational semantics of mini Cecilwork out the semantics of mini Cecil in class.* overview* multiple implementations of a typethis allow variant-like (sum) data structures(otherwise only have record-lik
Iowa State - COMS - 541
CS 541 Lecture -*- Outline -*- * stream design examplemain focus is conceptual modeling.could put coding problem in a class.Streams (from Rich Wagner's thesis.)Motivation is animation,want to move an icon from point S to point E in 4 steps.Pu
Iowa State - COMS - 541
CS 541 quiz on functions as first class values* quiz (just for fun, not graded)Do one of the first two, and then some of the othersif you finish early* What is the the result of the following expression?let val m = (fn (x,y) =&gt; (fn f =&gt; f(x,y); va
Iowa State - COMS - 541
from ftp.cis.upenn.edumiller/iclp91.dvi.Z @InProceedings(miller91iclp, Author=&quot;Dale Miller&quot;, Title=&quot;Unification of Simply Typed Lambda-Terms as Logic Programming&quot;, Editors = &quot;Koichi Furukawa&quot;, Booktitle=&quot;Eighth International Logic Programming Confe
Iowa State - COMS - 541
CS 541 * quiz on the untyped lambda calculus-1. Give fully parenthesized forms for the following lambda-terms. (Note that the backslash (\) is meant to represent lambda:(a) \x.x y z(b) x y \x. x y(c) x y (z w)2. What are the free variables of t
Iowa State - COMS - 541
Com S 541 Lecture -*- Outline -*-* team work (can omit) * motivation-COOPERATIVE LEARNING BENEFITS+ active learning+ academic achievement+ higher-level thinking skills+ attitudes, motivation+ teamwork, interpersonal skills+ communication skills
Iowa State - COMS - 541
CS 541 Lecture -*- Outline -*-* Structural operational semantics* two styles-STYLES OF STRUCTURAL OPERATIONAL SEMANTICS names better forbig step, reasoning about programevaluation,naturallittle step compilers, concurrencycomputationTTS-* eval
Iowa State - COMS - 541
Com S 541 - Programming Languages IJanuary 31, 1993HOMEWORK 3: What do you want to learn?Due: February 5, 1993You have been hired by this class (Com S 541), Bamshad, and Garyto consult with them about what should be studied during the restof this c
Iowa State - COMS - 541
Com S 541 - Programming Languages IJanuary 27, 1993HOMEWORK 2: Programming Languages and Comp. Sci. ResearchDue: February 1, 1993You have been recommended by the owners of the company to thefaculty search committee of a prominent Midwest University
Iowa State - COMS - 541
Com S 541 - Programming Languages IJanuary 20, 1993HOMEWORK 1: The Economic Impact of Programming LanguagesDue: January 22, 1993The owners of the same company liked your previous work, and have hiredyou again! But being hard-nosed business people, t
Iowa State - COMS - 541
CS 541 Lecture -*- Outline -*-* Specifying distributed systemsA programming method for distributed systems, based on the paperLiskov and Weihl, `Specification of Distributed Programs',Distributed Computing Vol. 1, pages 102-108, 1986.* the problem
Iowa State - COMS - 541
CS 541 Lecture -*-Outline-*-* Bindings (Ch. 4)- allow &quot;value implementation independence&quot;- abbreviation* Bindings and Environments (4.1)Environments can also be interpreted as functions; the same &quot;set of bindings&quot; is looked at as in the other wa
Iowa State - COMS - 541
CS 541 Lecture -*- Outline -*-* FP systems (may omit)John Backus's langauge, from his turing award lecturein contrast to systems based on lambda calculus,no way to make new combining forms(i.e. can only name compositions of built-in things)* FP
Iowa State - COMS - 541
CS 541 Lecture -*- Outline -*-* Input/Output in functional languagesreferences: Hudak's computing surveys paper (ACM CS, Vol 21, Num 3, Sept. 1989, pages 359-411) Wadler's comupting surevys paper (ACM CS, Vol 29, Num 2, Sept. 1997, pages 240-263)*
University of Hawaii - Hilo - ETEC - 698
Addressing Issues of Social Justice with TechnologyMike Menchaca, Ed.D. mikepm@hawaii.edu Tracie Ortiz (A-M) tracier@hawaii.edu Alex Parisky (N-Z) parisky@hawaii.eduMenchaca, Ortiz 2009OverviewFuturism vs. Reality Diverse Learners Political ActionFut
University of Hawaii - Hilo - ETEC - 698
Addressing Issues of Social Justice with TechnologyMike Menchaca, Ed.D. mikepm@hawaii.edu Tracie Ortiz (A-M) tracier@hawaii.edu Alex Parisky (N-Z) parisky@hawaii.eduMenchaca 2009Overview Instructorintroduction TA introductions Student introductions D
Boise State - CS - 354
Chapter 8StatementLevel Control Structures Sections 14Levels of Control Flow Within expressions (Chapter 7) Among program units function calls controlled by precedence and associativity Among program statements Selection Repetition Unconditional bra
Penn State - PHYS - 212
Physics Pre-lab 212P-5 Template Resistance and Ohm's Law Name:_ Section:_Date:_Pre-lab Questions:These prelab questions require you to carry out some simple experiments. It may be convenient to enlist the help of a friend for an extra pair of hands. Q1
Boise State - CS - 354
COMPSCI 354 Final Exam (5/10/07)Time: 120 minutes Name : This exam has 14 questions, for a total of 205 points.Question 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Total:Points 25 15 15 10 10 15 10 10 10 10 15 20 20 20 205Score1. (25 points) Scheme Lists. a. W
Hudson VCC - ENSC - 285
Watershed Assessment (ENSC 202)Lab 1 Extracted from Vermont ANR Stream Geomorphic Assessment Protocols Handbook - IntroductionENSC 202 2004 Lab 1 - Introductiongeo-morphic = land-shape&quot;Fluvial geomorphic science explains the physical river processes a
SUNY Buffalo - CSE - 462
Review for Final ExamCSE462 B.RamamurthyDate and Location Date : 5/9/2000 (Tuesday) Time : 8.00 11.00AM Place : NSC 215General Information Open book (Your text book only) Bring your calculator Only topics covered after the Exam 1Topics Chapter 6 :
University of Toronto - CSC - 263
Computer Science 263 St. George Campus Homework Assignment #3 Due: July 17, 2007, by 6:10 pmJuly 7, 2007 University of Toronto1. Please complete and attach (with a staple) an assignment cover page to the front of your assignment. You may work alone or w
Minnesota - FEB - 012001
THE JOURNAL OF BIOLOGICAL CHEMISTRY 1999 by The American Society for Biochemistry and Molecular Biology, Inc.Vol. 274, No. 38, Issue of September 17, pp. 2669126696, 1999 Printed in U.S.A.Mechano- or Acid Stimulation, Two Interactive Modes of Activation
Davidson - ECO - 202
NameDavidson College Department of Economics Mark C. Foley Fall 2001Intermediate Microeconomic Theory Review #1Selected Suggested SolutionsSection I: Multiple Choice Indicate the best answer in the space provided to the right of each question. 1. If b
Lake County - ECE - 461
University of IllinoisProblem Set #2 Page 1 of 2ECE 361 Spring 2001Assigned: Tuesday January 23, 2001 Due: Tuesday January 30, 2001 Reading: Blahut, Introduction to Telecommunication Theory, Chapters 1-2 Problems: 1. Given x &gt; 0, we now know how to com
Washington - FIT - 100
Lab 9 Time Shift: ConditionalsNow that you know the basics of working with JavaScript, we'll work on a more complicated web page that will give us a chance to see how web forms and JavaScript programming can work together. In the process, we'll also get
UNI - CNS - 062
vti_encoding:SR|utf8-nl vti_author:SR|BEN.SCHAFER\schafer vti_modifiedby:SR|BEN-SCHAFER\schafer vti_timelastmodified:TR|04 Nov 2008 19:19:45 -0000 vti_timecreated:TR|29 Jan 2003 21:13:20 -0000 vti_title:SR|PowerPoint Presentation vti_assignedto:SR| vti_ap
CSU San Marcos - HD - 301
Chapter 17: Physical and Cognitive Development in Late AdulthoodVocabulary Terms Primary Aging - gradual, inevitable process of bodily deterioration that begins early in life Secondary Aging - results of disease, abuse and disuse - avoidable factors Youn
BYU - CS - 478
Tic-Tac-Toe help fileEach line of test or training data contains 9 input values and 1 output value.The input values are in cfw_1,0,-1 where 1 represents an x, 0 a blank position, and -1 an o on the 3 by 3 playing board of a tic-tac-toe game.The output
USC - CS - 583
CS 583 Computational Geometry Fall 2002Homework #4Computational Geometry ExercisesThis is a series of exercises that you need to answer in text format (word, pdf, or plain ascii files are accepted). Let P be a set of 2D points. Lets define the Furthest
TN Tech - CSC - 202
1 egy 2 ketto&quot;3 ha'rom4 ne'gy5 o:t6 hat7 he't8 nyolc9 kilence10 ti'z11 tizenegy12 tizenketto&quot;13 tizenha'rom14 tizenne'gy15 tizeno:t16 tizenhat17 tizenhe't18 tizennyolc19 tizenkilenc20 husz21 huszonegy22 huszonketto&quot;23 huszonha'rom24
University of San Francisco - MATH - 202
Department of MathematicsLinear Algebra and ProbabilityHomework Key Assignment 3Friday, February 13Assignment p. 40: 1, 2, 3, 5, 12ac, 15ab, 17, 18ab, 26, 27 Apply the back-substitution algorithm to the triangular system at the top of page 46. Your an
Berkeley - N - 252
Goodbye to Computer Arhcitecture and How to Have a Bad Career in Research/AcademiaProfessor David A. Patterson Computer Science 252Lecture 21:Spring 2001DAP Spr.`01 UCB 1Review of Course Review and Goodbye to Computer Architecture, topic by topic +
Berkeley - N - 252
CS252 Graduate Computer ArchitectureLecture 17: ILP and Dynamic Execution #2: Branch Prediction, Multiple IssueMarch 23, 2001 Prof. David A. Patterson Computer Science 252 Spring 20013/23/01CS252/Patterson Lec 17.1Review Tomasulo Reservations statio
Berkeley - N - 252
What is Multimedia Processing?CS252, Lecture 15: Multimedia Instruction Sets: SIMD and Vector C.E. Kozyrakis, 3/14/01Lecture 15 Multimedia Instruction Sets: SIMD and VectorChristoforos E. Kozyrakis(kozyraki@cs.berkeley.edu) Desktop: 3D graphics (gam