Channel Coding – Lecture Note – ITC

Click following link to download a lecture note:

Channel Coding – Lecture Note

Questions Bank – ITC

1. Apply Huffman coding method for the following message ensemble:
[X] = [ x1 x2 x3 x4 x5 x6 x7]
[P] = [ 0.4 0.2 0.12 0.08 0.08 0.08 0.04]
Take M = 2, Calculate: (i) Entropy (ii) Average Length (iii) Efficiency
2. Explain Huffman Coding technique in detail.
3. Given the messages s1,s2, s3 and s4 with respective probabilities of 0.4, 0.3, 0.2 and 0.1, construct a binary code by applying Huffman encoding procedure. Determine the efficiency and redundancy of the code so formed.
4. Explain in short: (i) Hamming Distance (ii) Uniquely decodable codes
5. What is uniquely decodable code? Check which codes are uniquely decodable and instaneous?
S1={101,11,00,01,100} S2={0,10,110,1110,…..} S3={02,12,20,21,120}
6. What is the need of instantaneous codes? Explain the instantaneous codes in detail with suitable example.
7. Apply Shanon Fano coding algorithm to given message ensemble:
[X] = [x1 x2 x3 x4 x5 x6]
P[X] = [ 0.3 0.25 0.2 0.12 0.08 0.05]
Take M=2, Find out: (i) Entropy (ii) Code words (iii) average length (iv) efficiency
8. Explain Shanon-Fano code in detail with example. Mention its advantages over other coding schemes.
9. A source emits an independent sequence of symbols from an alphabet consisting of five symbols A, B,C,D and E with probabilities of 1/4,1/8,1/8,3/16,and 5/16 respectively. Find the Shannon code for each symbol and efficiency of the coding scheme.
10. Explain Arithmetic Coding technique in detail with example.
11. Apply Arithmetic Coding to following string: “SWISS_MISS”
12. State and explain Shannon’s Hartley law. Derive the expression for the upper limit of the channel capacity. Discuss the tradeoff between S/N ratio and bandwidth.
13. Explain generator and parity-check matrices of a (7, 4) systematic code, giving an example.
14. The generator polynomial of a (7, 4) cyclic code is g(x) = 1+x+x3 . Find the code words for the following data (i) 1101 (ii) 0101 (iii) 1001
15. The generator polynomial for a (15,7) cyclic code is g(X) = 1+X4 +X6+X7+X8
(i) Find the code vector in systematic form for the message D(X) = X2+X3+X4
(ii) Assume that the first and the last bit of the code vector V (X) for D(x) = X2+X3+X4 suffers transmission errors. Find the syndrome of V(X)
16. Explain coding and decoding techniques for cyclic codes in detail with diagram.
17. Write a short note on Convolution Coding.
18. Write a short not on storage and transmission of text, audio and video.
19. Explain Cryptography and Information Security.
20. Explain how Huffman Coding is used in Text Coding and Audio Compression?
21. Explain lossy JPEG Image Compression standard.
22. Write a short note on Video Compression.
23. Explain MPEG-1 standard giving the details of audio and video compression techniques applied.

Exploring Graphs – PPT

Click following link to download Exploring Graphs PPT.

Exploring Graphs – PPT