INFORMATION CODING TECHNIQUES 2 Marks and 16 Marks For All Units UNIT I PART - A 1. What is information? 2.

. Give two properties of information. 3. What is entropy? 4. Give two properties of entropy. 5. What is external property? 6. What is extension property? 7. What is discrete source? 8. State Shannons first theorem (or) source coding theorem. 9. What is data compaction? 10. What is decision tree? Where it is used? 11. How will you check the condition for validity in ternary Huffman coding? 12. What is instantaneous code? 13. What is uniquely decipherable code? 14. How an encoding operation is taken place in Lempel- ziv coding using binary sequence? 15. What is discrete channel? 16. What is memory less channel? 17. What is the important property while using the joint probability (xj, yk)? 18. What is the important property while using the conditional probability (xj / yk)? 19. What is the important property while using the conditional probability (yk / xj)? 20. Define mutual information. 21. Give two properties of mutual information. 22. Define channel capacity. 23. State Shannons second theorem (or) channel coding theorem. 24. State Shannons third theorem (or) Information capacity theorem. 25. What are the two important points while considering a code word?

PART B

1. a. How will you calculate channel capacity? (04) b. Write channel coding theorem and channel capacity theorem. (04) c. Calculate the entropy for the given sample data AAABBBCCD. (04) d. Prove Shannon information capacity theorem. (04) 2. a. Use differential entropy to compare the randomness of random variables. (04) b. A four symbol alphabet has following probabilities Pr(a0) =1/2 Pr(a1) = 1/4 Pr(a2) = 1/8 Pr(a3) = 1/8 and an entropy of 1.75 bits. Find a codebook for this four letter alphabet that satisfies source coding theorem. (04) c. Write the entropy for a binary symmetric source. (04) d. Write down the channel capacity for a binary channel. (04) 3. a. A discrete memory less source has an alphabet of five symbols whose probabilities of occurrence are as described here Symbols: X1 X2 X3 X4 X5 Probability: 0.2 0.2 0.1 0.1 0.4 Compute the Huffman code for this source .Also calculates the efficiency of the source encoder. (08) b. A voice grade channel of telephone network has a bandwidth of 3.4 kHz. Calculate, (i) The information capacity of the telephone channel for a signal to noise ratio of 30 dB. (04) (ii) The min signal to noise ratio required to support information transmission through the telephone channel at the rate of 9.6Kb/s. (04) 4. A discrete memory less source has an alphabet of seven symbols whose probabilities of occurrence are as described below Symbol : s0 s1 s2 s3 s4 s5 s6 Prob : 0.25 0.25 0.0625 0.0625 0.125 0.125 0.125
2

a. Compute the Huffman code for this source moving a combined symbols as high as possible. (10) b. Calculate the coding efficiency. (04) c. Why the computed source has a efficiency of 100%. (02) 5. a. Consider the following binary sequences 111010011000101110100.Use the Lempel Ziv algorithm to encode this sequence. Assume that the binary symbols 1 and 0 are already in the code book. (12) b. What are the advantages of Lempel Ziv encoding algorithm over Huffman coding? (04) 6. A discrete memory less source has an alphabet of five symbols with their probabilities for its output as given here [X] = [x1 x2 x3 x4 x5 ] P[X] = [0.45 0.15 0.15 0.10 0.15]. Compute two different Huffman codes for this source .for these two codes .Find a. Average code word length. (08) b. Variance of the average code word length over the ensemble of source symbols. 7. A discrete memory less source X has five symbols x1,x2,x3,x4 and x5 with probabilities p(x1) 0.4, p(x2) = 0.19, p(x3) = 0.16, p(x4) = 0.15 and p(x5) = 0.1 a. Construct a Shannon Fano code for X,and Calculate the efficiency of the code. (08) b. Repeat for the Huffman code and Compare the results. (08) 8. Consider that two sources S1 and S2 emit message x1, x2, x3 and y1, y2, y3 with joint probability P(X,Y) as shown in the matrix form. 3/40 1/40 1/40 P(X, Y) _ 1/20 3/20 1/20 1/8 1/8 3/8 Calculate the entropies H(X), H(Y), H(X/Y), and H (Y/X). (16) 9. Apply Huffman coding procedure to following massage ensemble and determine Average length of encoded message also. Determine the coding efficiency. Use coding alphabet D=4.there are 10 symbols.
3

X = [x1, x2, x3x10] P[X] = [0.18,.0.17,0.16,0.15,0.1,0.08,0.05, 0.05,0.04,0.02]. (16) UNIT II DATA AND VOICE CODING PART-(2marks) 1. What is quantization? 2. What is quantization error? 3. Define uniform quantization. 4. How Hunting and slope overloading problems can be solved? 5. Define Mid tread quantization. 6. Define Mid rise quantization. 7. What is PCM? 8. Specify the 3 elements of regenerative repeater. 9. What is DPCM? 10. How DPCM works? 11. How a speech signal is coded at low bit rates? 12. What is ADPCM? 13. What is AQF? 14. What is AQB? 15. What is APF? 16. What is APB? 17. What is ASBC? 18. Give the main difference between PCM and ASBC. 19. What is noise-masking phenomenon? 20. How much delay that is taken place in ASBC? 21. What is delta modulation? 22. What is the maximum slope of a signal x(t)? 23. What are the drawbacks in delta modulation? 24. What is hunting? 25. What is slope overloading?

PART-B 1. a. Compare and contrast DPCM and ADPCM (06) b. Define pitch, period and loudness. (06) c. What is decibel? (02) d. What is the purpose of DFT? (02) 2. a. Explain delta modulation with examples. (06) b. Explain sub-band adaptive differential pulse code modulation. (06) c. What will happen if speech is coded at low bit rates. (04) 3. With the block diagram explain DPCM system. Compare DPCM with PCM & DM systems. (16) 4. a. Explain DM systems with block diagram. (08) b. Consider a sine wave of frequency fm and amplitude Am, which is applied to a delta modulator of step size _ .Show that the slope overload distortion will occur if Am > _ / ( 2fmTs) Where Ts sampling. What is the maximum power that may be transmitted without slope overload distortion? (08) 5. Explain adaptive quantization and prediction with backward estimation in ADPCM system with block diagram. (16) 6. a. Explain delta modulation systems with block diagrams. (08) b. What is slope overload distortion and granular noise and how it is overcome in adaptive delta modulation. (08) 7. What is modulation? Explain how the adaptive delta modulator works with different algorithms? Compare delta modulation with adaptive delta modulation. (16) 8. Explain pulse code modulation and differential pulse code modulation. (16) UNIT III ERROR CONTROL CODING PART-A(2marks) 1. What is the use of error control coding? 2. What is the difference between systematic code and non-systematic code? 3. What is a Repetition code? 4. What is forward acting error correction method? 5. What is error detection?
5

6. Define linear block code. 7. Give the properties of syndrome in linear block code. 8. What is Hamming code? 9. When a code is said to be cyclic? 10. Give the difference between linear block code and cyclic code. 11. What is generator polynomial? 12. What is parity check polynomial? IT1301 Information Coding Techniques 5 Kings College Of Engineering, Punalkulam 13. How will you convert a generator polynomial into a generator matrix? 14. How will you convert parity check polynomial into a parity check matrix? 15. How a syndrome polynomial can be calculated? 16. Give two properties of syndrome in cyclic code. 17. Define Hamming distance (HD). 18. Define Weight of a code vector. 19. Define minimum distance? 20. What is coset leader? 21. What is convolutional code? 22. Define constraint length. 23. What is meant by tail of a message? 24. What is state diagram? 25. What is trellis diagram? PART-B 1. Explain Linear Block Code. (16) 2. Explain cyclic code in detail. (16) 3. Explain Convolution codes. (16) 4. Write the procedures for designing an Encoder circuit. (16) 5. Write the procedures for designing a syndrome calculator circuit. (16)

UNIT IV COMPRESSION TECHNIQUES PART-A(2marks) 1. How compression is taken place in text and audio? 2. Specify the various compression principles? 3. What is the function of source encoder and destination decoder? 4. What is lossy and loss less compression? 5. Define run-length encoding. 6. Define statistical encoding. 7. Define Differential encoding. 8. Define transform coding. 9. Define spatial frequency. 10. What is a horizontal and vertical frequency component? 11. Define static and dynamic coding. 12. Define Huffman tree. 13. Let us consider the codeword for A is 1, the codeword for B is 01, the codeword for c is 001 and the codeword for D is 000. How many bits needed for transmitting the text AAAABBCD. 14. Give two differences between Arithmetic coding and Huffman coding. 15. Define GIF. 17. Define TIFF. 18. Define termination code and Make-up code table. 19. Define Over scanning. 20. What is modified Huffman code? 21. What is one-dimensional coding? 22. What is two-dimensional coding? 23. Define pass mode. IT1301 Information Coding Techniques 6 Kings College Of Engineering, Punalkulam 24. Define Vertical mode. 25. Define Horizontal mode.
7

PART-B 1. a. Discuss the various stages in JPEG standard. (08) b. Differentiate loss less and lossy compression technique and give one example for each. (04) c. State the prefix property of Huffman code. (04) 2. Write the following symbols and probabilities of occurrence, encode the Message went# using arithmetic coding algorithms. Compare arithmetic coding with Huffman coding principles. (16) Symbols: e n t w # Prob : 0.3 0.3 0.2 0.1 0.1 3. (a) Draw the JPEG encoder schematic and explain. (10) (b) Assuming a quantization threshold value of 16, derive the resulting quantization error for each of the following DCT coefficients 127, 72, 64, 56,-56, -64,-72,-128. (06) 4. a. Explain arithmetic coding with suitable example. (12) b. Compare arithmetic coding algorithm with Huffman coding. (04) 5. a. Draw JPEG encoder block diagram and explain each block. (12) b. Why DC and AC coefficients are encoded separately in JPEG. (04) 6. a. Discuss in brief about the principles of compression. (12) b. In the context of compression for Text, Image, audio and Video which of the compression techniques discussed above are suitable and Why? (04) 7. a. Investigate on the block preparation and quantization phases of JPEG compression process with diagrams wherever necessary. (08) b. Elucidate on the GIFF and TIFF image compression formats. (08) UNIT V AUDIO AND VIDEO CODING PART-B(2marks) 1. What is LPC? 2. What are Vocal tract excitation parameters? 3. Give the classification of vocal tract excitation parameters. 4. What is CELP?
8

5. What are the international standards used in code excited LPC? 6. What is processing delay? 7. What is perceptual coding? 8. What is algorithmic delay? 9. What is called frequency masking? 10. What is temporal masking? 11. What is called critical bandwidth? 12. Define dynamic range of a signal. 13. What is MPEG? 14. What is DFT? 15. What are SMRs? 16. What is meant by AC in Dolby AC-1? 17. What is meant by the backward adaptive bit allocation mode? 18. List out the various video features used in multimedia applications. 19. What does the digitization format define? 20. What is SQCIF? 21. What is motion estimation and motion compensation? 22. What are intracoded frames? 23. Define GOP. 24. What is a macro block? 25. What is H.261? 26. What is GOB? 27. What is error tracking? 28. What are AVOs and VOPs? 29. What is the difference between MPEG and other standard? 30. What are blocking artifacts? PART-B 1. a. Explain the principles of perceptual coding. (12) b. Why LPC is not suitable to encode music signal? (04) 2. a. Explain the encoding procedure of I,P and B frames in video encoding with suitable diagrams. (12)
9

b. What are the special features of MPEG -4 standards. (04) 3. Explain the Linear Predictive Coding (LPC) model of analysis and synthesis of speech signal. State the advantages of coding speech signal at low bit rates. (16) 4. Explain the encoding procedure of I,P and B frames in video compression techniques, State intended application of the following video coding standard MPEG -1 , MPEG -2, MPEG -3 , MPEG -4 (16) 5. a. What are macro blocks and GOBs? (04) b. On what factors does the quantization threshold depend in H.261 standards? (03) c. Discuss the MPEG compression techniques. (09) 6. a. Discuss about the various Dolby audio coders. (08) b. Discuss about any two audio coding techniques used in MPEG. (08) 7. Discuss in brief, the following audio coders: a. MPEG audio coders. (08) b. DOLPY audio coders. (08) 8. a. Explain the Motion estimation and Motion Compensation phases of P and B frame encoding process with diagrams wherever necessary. (12) b. Write a short note on the Macro Block format of H.261 compression standard. (04)

10