mt 8-03 = Le Anewer No g~ Ol pe NO memoryless Channele ¢— ae fecatnde Communication over “memoryless channel takes place in a discete ®{ “channel useo” indexed by the natural no. NEN + A dlcreke memory-Lecs channel i> a sakiettcal mod with an input x & outpat y that io a noley version Of ks both Xk ¥ ave random ; Delerminiete channel :- number vor tables. T/P uniquely specifies the ofp HV/x)=6 Bum (n row =! Eloment are either O evt Matrix fas onr & only ons non-zeo @iment in each vec. (BH) Channd efficiency ts & meontie of channel performance In relation to efficiency, 1. a. 3. uw 6. Answer _N oe tm © chanel matrix Copaeliy= max I (xy) 0 e t ‘A ‘ a One d = OC = max ‘H(Y)- (x) a L [ Cua, t-2 = tna ty) = HCA) i ie! The fist quen for the max. Hoy) would be Dog x but cane achieve This by ary choice of tp diatloution Pid. let E= Evert Yee tring exp- W(Y)= RCYE)e HE) H(Y/E) le Plxei)oa HO) WC a Me ve Be ate) \ralegg A lrasSegnlt-d) " 7 HOV J= (l=) Om) + HOA)oP achieved by Tet oan ‘Answer No: Oy Entropy. of the peor Hg) i 1 jolt Clp prob- aye (Y¥=0) = 0.S(I- €) +0.s(6) = 0-S : PY=() = OS(I-E)+OSE = OS entropy of tus didtvibation is HCY) =L bit , juot ar for the entropy Hix) of the I/p ditribution . Voint * prob: distribution (x,y) fo ~ ce 0-56 } ase os(i-e) Gnd the entropy of te joint oldtribation a - HG@8)= ea POG) Gogo POY) = —(1-€) £6o9(0:S5(1-€)] - € koglose) HOG) = 1-€ fog - (1-€ Nog (\-€) The medual info. & F(x;¥)=HOx)+ HCY)-HO,4) which we Can evdlucte fram quanti aba an - 1+ Eloge +(I-€) 009 (rE), Sn {0 cae ezo & eal te muteal Info yeachey Ws Mox. of t bit & the to abs then dhe ehonnol capacity Sf E20S , He channel capootty §S minimal & equal to zero (0)-(x9) = O1403=0- § plva\le 008+0.1 01S (xy) =OOStO] = lS Pg) = 0:08 Ply) = 025 40:10 =0.8S P(Y_)= 024005 <0.05 0 (da) = O+ OOS 400g =4.2 0 (Gy) = OL “plyid = Hoos = PC) fog Pg) 200s = -(0. 05 fog 0-28 +04 Loga.u + 0150 O54 0.05 Lg 0S ) WOKS x PoxiGi log Plul.gi) [HOI= Gace bitslexmlat | zi jel = (9504-25 +011 0 01+ 05!0g 0.3 + H(\)= (0-85 og 0:25 + 0.38 ly 0:35 + OOS fog OOS +0009 OL + a 0:2 by 0:2 + Of og ol) CoS ly 005+0.1l901 100skzo0s) [HO = ese olts (sginbo [Raw= QiG6S bits (sqinlad s ; HU) = Spel ty bog ( yj) = a = 00% log Sh $011 fog r+ OBIT + 01:05.0y Yq FO1 Ly Yo + 0.08 By Vyt Or( Dg ! + 0:08 Log My ROGY) = 0.409 bits /symbal uciwe = = 00) gt) fog (Yili) (2l get = 0-25 og | + O11 Dog Yu +0rS fog Sky + 0.08 By Nig + 0/ Bg %q +906 Lgl/o +0: Log Ya, +0.08 Leg | HCY[X) = 6 biks | eymbo.edecoding 1) a more efficient method of dec ling 0 linear code over a noisy channel . Syndrome decoding t= minimum — aiatance decoding. using a reduced Lookup table . The eyndrome S depends only on he enor tern ard rot on the ranemitted codecord. for @ Linear block code the synchome S i» equal to the sum of Hose yows Of HT whee eros fave occurred » where HT to the transpose of parity check matrix. Answer No :— I(b) Hamming cdibtance i a metric for compa ring tuo Linear binary data strings « while Comparing two binary atrings, of equal Length. , Hamming distance the number of bit positions in which the two bits are different. Erie Ng) Mescage ({J = (t! ¢ 0] c= (iJ [a] ee tetete 01) o-oo -O86 ae) a coo COoO-a Sawsz S eee # 2 a ° = sees Sg ae & 2 : - ema 9 O98 oa foe SKS! ons 1 waa ee Os “4 Oo gS See ee =O) ee econ = i ee Co os See o-oo ae) eS) ; moO) ae Ss => a se a = aes a sseTu 7 = Bieta Le) oo caer [oo wa ee = a Bose 5 os Sean sh ance =. & or @ 8 1" oo 2 So pe Tee v i: 40 CO Oe o RG ON! i! ieeOnoal 0 4 CMO | od O41 OOo 4 fern Onto 4 4 A BEOlo 6.1 1.0 4 ae Weert at lt 4 a OF CLG imo tf O00 4 plage) XO) iat 1 0 04 4y Lorine imcrenly fo 1 0 4 Te Ce le Opoet oO le tl 4 eet Cori | | OO 4 eo iodo to ! 4 eto eee Oo 61 «1 lo 4 Crovt Meee rt 8 The minimam weight of tus code wo y. Answer Nor Ou Syndrome olecocling example: An (ou) binary Liver bolacte ds defined an Meee oc tf tlt 1) 900 pee Fri > g(t fi tithe se eon! | ot [0a meemcual 0 CO Omer tot 1 6 i aro ema ae I Coneider two passiblh menages - m= fo ttal moz(! or tj = (011 oo1toy} C= [o1ooio! t] Suppose enor pattem e=(00000!100) ty added to tooth Codewords i= (0 1 1000 10] fee (0100 1 1¢8) Sie (1011) ee2 [10 11 Both eundyome equal columm ¢ Of Hy Hence cocceler correc} bit b 6. coole ¢4% Ry Time domain approach length of encoded sequence = n(L+m] 2 (S42) ek ae Generator matrix size = Lx (n(cem] = Sx lq POCO MROREC sO 6 6 6 6 0] S(GSGtGuieMeMl ot ) 0 0 6 6 6 © CRCOMOME@ 6 9 { o-0.0 6 DECRG Ono | { o 1 1 6 0 ec oC tt Olt SS J oyiy = ] {cj (1 (61 moe cet | Oo 2°60 © 0 06 0 LoL Meany to | | o 4 6 66 6 =| Molise so) i, of to 08 0 Moe Oo co 1 | i oO tL Ole Memon Goo go 6 tf tf 1 6 Wet) éxl4 foie oir to1orss | * Transfer clommain approch — om 4 ra nF Meseage - 1011 cs dew) Gf) dog = Lex2+ x4 = (142408) (hehe) GyetLt > teutn® slttlool GiemtO eset cl) = dew. G(x) = (1404 x8) (Lx) = dorbiat CMe Le etre 408 cf = Lettre greta F4rE eto= chet) + (cl) x* eet xt xe ert a +l Tlolt{folo lt 8 ore 4 4 YO a xi2] (Js={tr a1 to ot] ; Lay nat ee cg (eanalutian encader with Kel sn=2 ty ) Tretia Diagram Representation ~ Trellis Diagram