_ 1 Special topics im communications. F i ad < Pha. ‘ ti cot ns wl Paka er ear es cas y. Yoo Ys having the > Cmte tpt ont OF). api be j fot 2 kpeenble olsen waits Ye 21 show that’: } Ni p. ; ee “be apes tx? Dx? tx? 4x7 4x 4 Dare imeducible, “7s Pri a ' ‘i Ne > we —~ V $ & 2 g Par ce Sy * ee ape of ag, sh cute Rposte ~StBlea- a. Wo ped poles play (lel teh “Ieay “ Pheadhs FEMS (ed-aU-1) rE ss\= pod “a . an "fos 3: pe MAS fa: sie plo “fe aA-p) (-2Jh-9) 4 hott pwbbetdy PESde Pll) lr PCs, In) fe $6): Pode 6s) 2 Mp bed) eke A r&3=¢-9\ p@ar plaload geod feos = Ort U-ode (6.\=G9¥] @® sus Kt nerf wer (-he-te iy) AG)= -Z thes (eba ria >) = eA Sie) uiy)> - é (3 = cag desap- EP Blep babies, = ap Ba ap loge lp lee) Cp St Gop Ky : 2 pla tbted) uber pe ? He) 5 ie? we) phy Ale) [3 sha ad NOyane -p bog ert ah/d- ee ws eed es op he- mae ~ gle“) Bh (4 pA gles =e Bed) i) Been -qeakess-vhe itihail Ais Vee Che —Deapachiscsp i mee Ovni) AEaryytigy~ AOA =p ato (Ke- DMO 1t* UE Gp He) a! BAY pean tee fen © saptso\he- Pts Au): mec ot z-(s, whe ae, vob ron Bon 1 aa L- & 4.2 = eM4D. Carey ® He stu exkurign a Heoeg (EOS * peer=-e4b po sd7(Dal> eae (oss yas) 200% peas POS. 32004 fl>Ss9 > [C4 S2h> v0 (Essx)= coy oon thes ree TS SNe ge PPysdo glu seen RSa)z cou, eayres ORR et A =e Sse Ptaeded aoe eae gaol = i Pal yto SRONY + Xe SLY oy ORG +O Ko03 4 ‘ ( AN 4 Ae &, Ve 018) GF feng Moe ne, eA pC HAL © Apesa [eee pei yroged [ae Poe aS dena nytt janes Rea warcey pret Dadyria [rvcar FB aferben ae wy Mea 5 deed’ Oster Moly pr hodt Bie ntea PSA Bren Hartt, pets xh y28 Ea errr q 2 Alartes | Ft aoEESI6 EMD2 } +2? +1is primitive. ‘The polynomial p(x)= 1." Let erbe one of its roots. Construct the table of Galois field elements of GF(2’) 2. -Find the minimal polynomial of a anda” + ind the generator polynomial of a double error correcting (‘= 2) BCH code of lenath n=31. 4. We receive the polynomial(x) polynomial. 4x. Compute the corresponding error locating we Let g(x)=x°+a% 42° +34 +27 ++ Ibe the generator of a (15,5) cyclic code. 1- Find the code polynomial for the message i(x) =" +.x+1 in systematic form. 2. Find the generator matrix and the parity check matrix for this code. Pb3 Compute the entropy of the following uniformly distributed random variable with pate 1 osxsa fr@=ya 0 otherwise for the three following cases: a) a=1 b) a=4 oa-\EESIO EMD2 Pb1 3 Consider the polynomial x" +1 over GF[2]. 1. Show that it can always be factored as: x" +1=(x+1) p(a). 2. Show that the polynomial p(x)=p,+p,x+---+ p, ,x”" satisfies the following set of equations: Py. =15 Ppa = Pyzi---5 i= Pos Po=1 3. Show that gi(x)=x+land g,(x)= pfx) can be used as generators for an(n,n—I) and an (n,1) codes. 4.In the case of g,(x), compute the parity check matrix H. (hint: g,(x)has only one root and itis in GFI2}) 5. Show that g,(x) generates a repetition code. en ed, “Bika ff r The generator matrix for @ (6, 3) binary liiear 10001 G=|0 1010 . oo111 i 1 Z 10, 1, What is the parity check matrix for this code? 2. What is its minimum distance? How many errors can it correct? 3. How many possible syndromes does it have? How many correspond to single errors? Compute its Hamming bound. Is ita perfect code? ‘ 4. The received vector is(1_ 0 1 1 0 1). Derive the information vector (ie. decode the received vector).EESIG Synthese Pol Consider a three error correcting BCH code defined on GF[16] generated by x ext. a) Show that the independent roots area, a’ anda’*. b) Derive the generator polynomial g(x). . c) The obtained code is an (,k) code. What are the values of n and &? Pb2 A DMS generates four symbols {s,,s,,5,,s,}with probabilities P[s,]= P[s,]=0.3365 and P[s,]= P[s,]=0.1635 a) Design a Huffman code that encodes a single symbol at a time and determine the average code length per symbol. ©)Design a Huffman code that encodes two symbols ata time and determine the average code Jength per symbol. c) What is the minimum code length per symbol if we encode J symbols at a time Kiss01 es Pb3 Three messages m, m, and m; are to be transmitted over an AWGN channel with noise psd 3m. ‘The messages are associated with the following signals: _fl (ses7) so-{t (otherwise) 1 (osee2) fol $,(0=-s(0=4-1 (Es+s7) x 0 (otherwise) Paine a) ‘a) What is the dimensionality of the signal space? i L es Q; ic igs b) Find an appropriate basis for the signal space. c) Draw the signal constellation. 5 4) Derive and sketch the optimal decision regions. ) Which of the three messages is more vulnerable to errors and why?