Download PTU B.Tech 2020 March ECE 6th Sem BTEC 907 Information Theory And Coding Question Paper

FirstRanker.com

Roll No. HEEEEEEE [ ] Total No. of Pages : 02
Total No. of Questions : 09

--- Content provided by​ FirstRanker.com ---

--- Content provided by⁠ FirstRanker.com ---

INSTRUCTIONS TO CANDIDATES :

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

--- Content provided by⁠ FirstRanker.com ---

SECTION-A

1. Answer briefly :
   1. Write a short note on: Kraft inequality
   2. Prove that the mutual information of a channel is symmetric.
   3. What is ARQ? State its types.
   4. Briefly explain Hamming Sphere.

   --- Content provided by‌ FirstRanker.com ---

   5. What do you mean by generator matrices of the cyclic codes?
   6. Write the steps for decoding of BCH codes.
   7. Write short note on decoding methods of convolutional codes.
   8. Write short note on Hamming distance and code efficiency.
   9. Explain in brief Go Back N ARQ system.

   --- Content provided by‍ FirstRanker.com ---

   10. What do you mean by matrix description of cyclic codes?

SECTION-B

2. Prove that the average information is maximum when the messages are equally likely.
3. Show how a 4bit stage shift register can generate a convolution code for input train 11001.

--- Content provided by⁠ FirstRanker.com ---

4. What is Nyquist criterion? Prove its sampling theorem mathematically. What is the need of antialiasing filter? How does it affect the distortion?
5. Maximum likelihood algorithm is used for decoding. Show its convergence and implementation in comparison to conventional technique by taking one example.
6. Discuss in detail convolution decoding procedure using the Trellis diagram.

SECTION-C

6. Write down short notes on :
   1. RS codes

   --- Content provided by‌ FirstRanker.com ---

   2. Golay codes
   3. Shortened cyclic codes
   4. Burst error correcting code
7. Design a block code with minimum distance of three and a message block size of 8bits.

--- Content provided by‍ FirstRanker.com ---

8. Consider the random variable
   X1 X2 X3 X4 X5 X6 X7
   0.49 0.26 0.12 0.04 0.04 0.03 0.02
   1. Find the binary Huffman code for X.
   2. Find the expected code length for the encoding
   3. Find a ternary Huffman code for X.

   --- Content provided by‌ FirstRanker.com ---

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

FirstRanker.com