Save trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com un [TT | Fi i Information Theory & Goding hes. Note: Answer FIVE full questions, selecting rh Semester B.E. Degree Examination, lune!July 20! Go green M ‘at least TWO questions from each part. vane 1 a. A black and white TV pire comiss OT SES ies of picture information. Assume ach 5 line consists of 525 picture clements (pixels) and that each clemey ave BB brightness leet Picture are fopned ae aie of 20 famcstes cag Me tage tate of i information conveyed by 4 TV set toa viewer. 7} {Os Marks) g b. Obtain an expression for maximum entropy of a system. (06 Marks) a ©. Design a system to report the heading of a collection of | rs, cading levels are : 3 heading sigh (9) ung fet (and Tomine gh. ty intormaton et bs ae transmitted every second. Construct a model based on tagfen below Bb {) Onthe svorage during a ve porting er fe sang sight, 100 i sere tang Gand fon ere nga 4g (ii) Out of 200 cars that reported heading st thera tgporied goa straight a daring the vest reporting povods 30 oF om que und manne ring ht ae during the next period. Ee ii) Out of 100 cars that reported as turning ialing period, SO of them continued ag their turn and remaining headed st Mrext reporting period. Hd Gi) The dyrames ote eae ain Mo change dhe ieaing fom lf to ight Ba or right to loft during subsequent rods, ik «Find the entropy of each i {Find he enopy ofthe gl iG + Find the rate of transmis (10 Marks) FT 2. thwsource omits the meagmmpceeyigil of two nymbols cach Tess mesiaget and thsi a3 probabilities are given igfTal sign the source encoder using Shannon's encoding Ze algorithm and also find ‘effitiency. (10 Marks) gs 1 _ a [ Message Mi BCA] BC | Be iE Pobatiy F Ts ¢ 3 16 | 32 | 32 32. Eo» mame pie aly i codig aban fr. devin an y © Ey a fan 4 bees ee ee a sor Qecsigggptengh 1a. 3 ‘rete a2 3 3a A norlymr inary channel is shown in Fig,Q3 (a), ie 10951109, H(5)an (2) gen rox == Lampe 1)= 3, 0075 é= : oe x. o a . ss >; 3 ii) Find the capacity of the binary symmetric channel if = B= 6.75 (10 Marks) 4 ie oy) i 2% =< ey Gwe ree Hop) Fig. Q3 (a) ors S_. | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com b. What is the entropy (n) of the image below, where numbers (0, 20, $0, 99) der level intensities? [99199195 [99 [99] 99 [59] 95] [20/20 [20] 20) 20,20, 20 [20 o}olofotofotofo @ | 0 [30 s0, 30}30| 0 [0 To [30 |s0[s0] 500-10 0 [sof so} sof so, 0 [0 0 [050] 50] 50-0 ofotofofoiol@) z 2 ii) Show stop by step how fo cons fabove four intensity values in this image. Show the resulting code for gacheiignsity value, iii) What i the average number of bits nocded for eafiljgixel Wkjpe Huffman code? 4 a State Shannon-Hartley law. Derive an expres the bandwidth tends to infinity. b. An analog signal has a 4 kHz bandwidth. and cach sample quantized into 256 samples are statistically independent ') Find the information rate of ii) Can the ouiput of this soure bandwidth 50 kHz and (S23 iii) If the ouput of this s fasmitted without errors over an analog chansiel having (S/N) of 10 d effjic bandwidth requirement of the channel. (10 Marks) limit on channel capacity as (lo Marks) sampled at 2.5 times the Nyquist rate levels. Assume that the successive Sa. The parity check bifgfa Rp Haniming code +444, © gonerated by, ‘are the message bits. ‘gens matrix (G} and parity check matrix [H] for this code. 1 GH = 0. linear block code so obtained has a “dual” code. This dual code is @(n, n-K) vectors of the “dual code” for the (7, 4) Hamming code described above. Fid@ihe minimum distance of the dual code determined in part (iii) (10 Marks), n(n, K) Hamming code with a minimum distance of dyin 3 and a message length of Ifthe received code vector is R= [1 1110.0 1}. Detect and correct the single error shat has occurred due to notse (0 Marks) 2of3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.vturesource.com 10K} vurgated (n, K-1) Hamming code is obtained from the original (n, K) Hat iscarding some of the code vectors. Let g(x) denote the generator polys original hamming code. The most common expurgated hamming code is the 0 by 8,00) = (1+ x)g0); where (14x) is a factor of 144%". Consider the (7, 4) Hai generated by g(x)=1+x?+x", (0 Construct the cight code vectors in the expurgated (7, 3) Harmmjpgegode, aggyming a systematic format. Hence, show that the minimum distance of i 4. Gi) Determine the generator mutrix G, and the parity check mat fe expurgated hamming code. (iii) Devise the encoder for tho expurgated hamming ¢« shift register ‘contents in a tabular fashion for the message O11. Veriff the codg-vector so obtained using {V] = (DI[Gi)}. (iv) Devise the syndrome calculator for the expurgated (amt Hence, determine the syndrome for the received vector 0111110. i error, ifany, ip that received vector. 'b. The generator polynomial for (15, 7) cyclic code is g(x) (0) Find the code-veetor in systematic form fogshe me (i) Assume that the first and last bit of the & suffer transmission errors. Find the 7 (4 tacks) Ri et Diad=xtex?s xt 1 V(x) for Dix) = xi +x° 4 x! (06 Manns) 7 a. Consider the binary convolutional encode ‘ransition table, state diagram and th ‘encoded sequence for the message transform domain approach, ig. Q7 (a). Draw the state table, state ode tree. Using the code tree, find the ify the output sequence so obiained using (10 Marks) (0 Marks) ay codes, _Mcnccting codes anni 3of3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative