# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

10 Pages

### 06-HW-3-SOLUTIONS

Course: ECE 154, Fall 2009
School: UCSD
Rating:

Word Count: 3111

#### Document Preview

ECE UCSD 154C Communications Systems III Prof. Jack Keil Wolf Solutions to ECE 154C Problem Set 3 1. Solution: Since the window size is 32, we need 5 bits to encode the position of the matches. Refer to following pages for the procedure. 2. Solution: We will compute the case for 2 bits. The other cases can be done in the same way. However it can also be done by using Matlab as follows. Let the initial values for...

Register Now

#### Unformatted Document Excerpt

Coursehero >> California >> UCSD >> ECE 154

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.
ECE UCSD 154C Communications Systems III Prof. Jack Keil Wolf Solutions to ECE 154C Problem Set 3 1. Solution: Since the window size is 32, we need 5 bits to encode the position of the matches. Refer to following pages for the procedure. 2. Solution: We will compute the case for 2 bits. The other cases can be done in the same way. However it can also be done by using Matlab as follows. Let the initial values for ai s and bi s as the following. a = [-1.66, -0.589, 0.589, 1.665] b = [-, -1.177, 0.1.177, ] Since fX (x) is symmetric, we only need to compute one side of the region. Using the following formula for the Lloyd Algorithm, we acquire the iterated values of the ai s and bi s. aj = bj xfX (x)dx bj-1 bj f xdx bj-1 X = - 1 e-1/2x |bj j-1 2 Q(bj ) - Q(bj-1 ) b bj = The converged values are aj+1 + aj 2 a = [-1.5104, -0.4528, 0.4528, 1.5104] b = [-, -0.9816, 0, 0.9816, ] Now we compute average MSE. 4 2 bj bj-1 = j=1 (x - aj )2 fX (x)dx = 0.0328 + 0.0259 + 0.0259 + 0.0328 = 0.117 1 Let's check if this value satisfies the following inequality, where R = 2 and 2 = 1. 1 2 R log2 ( 2 ) 2 Then 22R 2 2 2 2 = 1/16 22R Hence the computed MSE satisfies the rate distortion function. We can compute the case for 3, 4, 5 bits in the same way. The following values were found with Matlab. For R=3, a = [-2.1519, -1.3439, -0.7560, -0.2451, 0.24...
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:

UCSD - BILD - 774
!rr 3 t' (% &amp;# \$7 9! &quot; ! G q 2 r r s r ! G B B i2p B B D2B B % B B 21B B A Q i B Bh ' XA gWd fd eb c` Y aW XVUTS E QIR H P E QI\$ G H !
W. Alabama - CS - 240
! ! &amp; % \$ # &quot;Designing good databasesDatabase desing A:Database design B: 4 3 2 1 0 ) ( ' ) % # '! 6 5 9! &amp; %
N. Arizona - GLG - 1011
N. Arizona - GLG - 1011
Waves, Currents, and CoastlinesChapter 10CoastlinesActive vs. passive margins Population concentration Seven of 20 largest US cities on or near coastline 53% US population lives in coastal countiesDeep-water wave form (water depth &gt; 0.5L)Wa
Delaware - CISC - 2602008
!!&quot; %#\$&amp;!&quot;\$'( *&quot;\$)+ /0 * * .1 .1 .1 .1 *,-. /0). 2 2 2 2 3.44 6&quot;* 253 3 7 . 3 ! ' *&quot;#\$ #&quot;% &quot;%&amp;#&quot; '#()!2 38 + 9* *&quot;\$98#\$ #&quot;% &quot;%&amp;#&quot; '#()
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 10two* there are 10 kinds of people in the world - those who grock binary, and those who do not.CISC 260 Fall 2008 Lecture 02Slide 1Agenda Course Administrivia (rerun, w/ places &amp; t
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 3CISC 260 Fall 2008 Slide 1Agenda Course Administrivia (rerun, w/ places &amp; times) Unaddressed from previous lectures Information Representation (mostly numbers) Zero the greatest
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 4CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures 3 Questions (from last time) Course AdministriviaRepresentation of Negative #s Rationale of
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 5CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures Truth Tables Boolean Algebra (P&amp;H) Laws Huntingtons Postulates Logic Equations De Morgans Laws S
Delaware - CISC - 2602008
Homework: (each of 5 questions are worth 1.5 grade points: max 7.5 points per homework)1. 2. 3. P+H COAD CH1, 1.1-1.28, 1.49 2. Convert -2047ten into a 32-bit twos complement binary number. With x = 0000 0000 0000 1011two and y = 0000 0000 0001 1001
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 6CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures Administrivia SOP/POS Continued GATES Logic Design Boolean Representations =&gt; Gates 3 Questions
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 7CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures Administrivia More Logic / Logic Design / Devices Common Components Blurring the lines / compiling t
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 8CISC 260 Fall 2008 Slide 1Agenda Questions w.r.t. HW / Unaddressed / Corrected from previous lectures Administrivia Programming Silicon / PLAs Memory, Timing, FPGAs 3 QuestionsCI
Delaware - CISC - 2602008
Homework: (each of 5 questions are worth 1.5 grade points: max 7.5 points per homework)1. Write the truth table, then draw the logic diagram for 2-bit (AND, XOR, NOR) and a 1-bit NOT. (you may cut and paste the spare parts on the next slide but mus
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 0x0D**00ds are that the superstitious will read something into this. CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures Administrivia PDFs only RE Homewo
Delaware - CISC - 2602008
!&quot; ) , *#\$ +%&amp;'(! +(.(. /(.&quot;!(0/ /('!(' -!#11 ! ((('!(-!(%5 !2%34+( 6 ( 6 6 ( (!6 7 8 *( - !86 7 *( 7 !6 1! 9! 9! ! 1! 1! 1 6 &quot;*( ! ! ! 1 &quot;6 *( !1 6 &quot;*( ! 1 6 &quot;*( !1 &quot;6 *( !
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 15CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures Administrivia MIPS resources HW3 Discuss More single Cycle datapath More multi-cycle instructions
Delaware - CISC - 2602008
Homework 3 (starting point, trivial example)# printodd - prints odd integer members of arC-u-do code:main:.globl main li \$t0, 0 lw \$s1, arlen li \$s2, 0x01 # i in \$t0 # arlen in \$s1 # mask to detect odd integerz # quit if i = arlen; # load ar[i]
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 16CISC 260 Fall 2008 Slide 1Agenda Unaddressed / Corrected from previous lectures Administrivia MIPS resources/HW3 Any difficulties? Procedures - simple-minded Procedures - simple-
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 17Substantially borrowed from: Mary Jane Irwin, psu.edu - CSE 331. COMPUTER ORGANIZATION AND DESIGN http:/mdlwiki.cse.psu.edu/twiki/bin/view/MDL/MJI331CISC 260 Fall 2008Slide 1Agenda
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 18Substantially borrowed from: Mary Jane Irwin, psu.edu - CSE 331. COMPUTER ORGANIZATION AND DESIGN http:/mdlwiki.cse.psu.edu/twiki/bin/view/MDL/MJI331CISC 260 Fall 2008Slide 1Agenda
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 19 - ReviewCISC 260 Fall 2008Slide 1Agenda Course Administrivia Course ReviewCISC 260 Fall 2008Slide 2Moores law w/r/t Processing Power, CostComputing power : (actually, # of
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 19Substantially borrowed from: Pradonet Nilagupta Floating point Arithmetic www.cpe.ku.ac.th/~pom/courses/204521/2005/FP_Arithmetic.pptCISC 260 Fall 2008Slide 1Agenda Unaddressed /
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 20Substantially borrowed from: Pradonet Nilagupta Floating point Arithmetic www.cpe.ku.ac.th/~pom/courses/204521/2005/FP_Arithmetic.pptCISC 260 Fall 2008Slide 1Agenda HW4 Unaddress
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 21Substantially borrowed from: Pradonet Nilagupta Floating point Arithmetic www.cpe.ku.ac.th/~pom/courses/204521/2005/FP_Arithmetic.pptCISC 260 Fall 2008Slide 1Agenda HW4 Unaddress
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 23Substantially borrowed from: Mary Jane Irwin, psu.edu - CSE 431. INTRODUCTION TO COMPUTER ARCHITECTURE http:/mdlwiki.cse.psu.edu/twiki/bin/view/MDL/MJI431CISC 260 Fall 2008Slide 1
W. Alabama - CS - 456
Chapter 1: roadmap1.1 What is the Internet? 1.2 Network edge 1.3 Network coreq end systems, access networks, links q circuit switching, packet switching, network structure1.4 Delay, loss and throughput in packet-switched networks 1.5 Protocol lay
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 26Substantially borrowed from:P&amp;H COAD; and from Memory Management - Randall D. Beer http:/vorlon.case.edu/~beer/EECS345 Richard McKenna http:/www.cs.sunysb.edu/~cse220 Memory Management
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 27Substantially borrowed from:Mary Jane Irwins Introduction to Computer Architecture http:/mdlwiki.cse.psu.edu/twiki/bin/view/MDL/MJI431CISC 260 Fall 2008Slide 1Agenda Correc
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 28Substantially borrowed from:Mary Jane Irwins Introduction to Computer Architecture http:/mdlwiki.cse.psu.edu/twiki/bin/view/MDL/MJI431CISC 260 Fall 2008Slide 1Agenda Corre
Delaware - CISC - 2602008
CISC 260 Machine Organization and Assembly LanguageLecture 29Substantially borrowed from:Mary Jane Irwins Introduction to Computer Architecture http:/mdlwiki.cse.psu.edu/twiki/bin/view/MDL/MJI431CISC 260 Fall 2008Slide 1Agenda Correc