B.E/B.Tech. DEGREE EXAMINATION, MAY/JUNE FOURTH SEMESTER INFORMATION TECHNOLOGY ~ ¥71251 INFORMATION CODING TECHNIQUES (REGULATION 2007) Tinie : Three hours Maximum : 100 marks 10. Answer ALL questions. PART A —(10 x 2 = 20 marks) ‘An event has four possible outcomes with probabilities p, =}. Pa a Ps =2, py =}. Find the rate of information when r = 1 messages/see. Define discrete memoryless channel. How can the slope over load error of Delta modulation be avoided? Name the techniques to achieve low bit rate coding. Give any two properties of eyelic codes. Define Repetition code. What is the significance of Arithmetic coding? List out the features of Tagged Image File Format. What is meant by motion estimation and compensation in MPEG? Give the merits and demerits of code excited linear predictive coding.11. 12. 13. 14, 15. 16. PART B — (5 x 16 = 80 marks) (a) Derive Shannon-Fano code for the source emitting symbols X = (2,,22)%5,%4,%5)%5) with probabilities P =(0.3,0.25,0.2,0.1,0.1,0.05) . (8) (b) Find the capacity of a Binary channel in bits/sec, when the probability of error is 0.1 and the symbol rate is 1,500 symbols/sec. (8) Or (a) State and prove Extremal property of Entropy. (10) (b) Find the channel capacity of BSC. (6) Explain the following schemes with necessary diagrams : (a) Adaptive Sub-Band Coding. (ao) (b) Differential Pulse Code Modulation. © Or Discuss in detail the following : (a) ADPCM. (10) (b) Drawbacks of Delta Modulation. ) Construct a (7,4) linear block code for the message vector (1110). The parity information is given as by =1mq +m, +g by = mg +my +g b, =m, +m, +m, Decode the codeword properly if the error occurs in c4 bit of the codeword. Or Construct a Convolutional encoder whose constraint length is 3 and has 3 modulo-2 adders and an output multiplexer. The generator sequences are e® =(0D; g? =010); ¢° =(,LD = Find the encoder output produced by the message sequence 1110. Also construct a code tree for the encoder for two stages.