Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    ITC 6thdec2017

    Uploaded by

    Koush Rastogi
    This document provides instructions for a test on information theory and coding. It contains 3 sections: Section A has 10 short answer questions worth 2 marks each. Section B has 4 long answer questions worth 5 marks each. Section C has 2 long answer questions worth 10 marks each. The test covers topics such as Kraft inequality, mutual information, ARQ protocols, repetition codes, cyclic codes, BCH codes, convolutional codes, Hamming distance, and CRC codes.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    ITC 6thdec2017

    Uploaded by

    Koush Rastogi
    27 views2 pages
    This document provides instructions for a test on information theory and coding. It contains 3 sections: Section A has 10 short answer questions worth 2 marks each. Section B has 4 long answer questions worth 5 marks each. Section C has 2 long answer questions worth 10 marks each. The test covers topics such as Kraft inequality, mutual information, ARQ protocols, repetition codes, cyclic codes, BCH codes, convolutional codes, Hamming distance, and CRC codes.

    Original Title

    ITC 6thDec2017

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides instructions for a test on information theory and coding. It contains 3 sections: Section A has 10 short answer questions worth 2 marks each. Section B has 4 long answer questions worth 5 marks each. Section C has 2 long answer questions worth 10 marks each. The test covers topics such as Kraft inequality, mutual information, ARQ protocols, repetition codes, cyclic codes, BCH codes, convolutional codes, Hamming distance, and CRC codes.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    27 views2 pages

    ITC 6thdec2017

    Uploaded by

    Koush Rastogi
    This document provides instructions for a test on information theory and coding. It contains 3 sections: Section A has 10 short answer questions worth 2 marks each. Section B has 4 long answer questions worth 5 marks each. Section C has 2 long answer questions worth 10 marks each. The test covers topics such as Kraft inequality, mutual information, ARQ protocols, repetition codes, cyclic codes, BCH codes, convolutional codes, Hamming distance, and CRC codes.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Roll No.

    Total No. of Questions: 09 Total No. of Pages: 02


    B. Tech. (ECE/ETE) (Sem.6)
    INFORMATION THEORY AND CODING
    Subject Code: BTEC-907
    Paper ID: A2395
    Time: 03 Hrs. Max. Marks: 60

    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.

    SECTION A
    1. a) Write a short note on : Kraft inequality

    o m
    b) Prove that the mutual information of a channel is symmetric.

    .r c
    c) What is ARQ? State its types.
    d) For a repetition code having two symbols 00000 and 11111 being transmitted, find the new

    p e
    d min if two symbols are erased due to a noisy channel.
    e) What do you meant by generator matrices of the cyclic codes?
    o m
    a .r c
    f) Write the steps for decoding of BCH codes.

    r p
    g) Write short note on decoding methods of convolutional codes.
    h) Write short note on Hamming distance and code efficiency.
    e
    i)
    j) b
    Explain in brief Go Back N ARQ system.

    a
    What do you meant by matrix description of cyclic codes? p
    2.
    SECTION B

    b rp
    A channel with two inputs X 1 and X 2 , three outputs Y 1 , Y 2 and Y 3 with noise matrix is given
    below:
    Y1 Y2 Y3
    X1 3/4 1/4 0
    X2 0 1/2 1/2
    Calculate I ( X;Y) with p( x 1 ) = p(x 2 ) = 0.5.

    3. Explain in detail the operation of Syndrome decoder for (n, k) block codes.

    4. Using the generator polynomial g(x) = 1 + x2 + x3, generate the systematic and non-
    systematic cyclic code words for the message vectors 1011 and 1001.

    | M71236 Page 1 of 2
    5. The convolutional encoder shown below has the following two generator sequences each of
    length 3.
    (1) (1) (1) (2) (2) (2)
    �𝑔𝑔0 , 𝑔𝑔1 , 𝑔𝑔2 � = (1, 1, 1) and �𝑔𝑔0 , 𝑔𝑔1 , 𝑔𝑔2 � = (1, 0, 1). Obtain the encoded sequence for
    the input message (m 0 , m 1 , m 2 , m 3 , m 4 ) = (10011)

    6. For systematic rate 1/2 convolutional code n=2, k=l and the constraint length k=2; parity bit is
    generated by the mod-2 sum of the SR output as. P=X+1 that is g(l,1) = (1,1).
    (i) Draw the figure of convolutional encoder and decoder.

    (iii) Draw static diagram

    o m
    (ii) Find out the output for message string (1 0 1 1 0......)

    .r c
    SECTION C
    7. (a) A channel has a bandwidth of 5 kHz and a signal to noise power ratio is 63. Determine the

    e
    required if the channel bandwidth is reduced to 3 kHz.

    p o m
    bandwidth needed if the S/N power ratio is reduced to 31. What will be the signal power

    a .r c
    (b) The parity check matrix of a (7, 4) linear code is as follows:
    1 1 1 0 1 0 0
    𝐻𝐻 = �1
    r 1p 1
    0
    0 1 0
    1 1 0
    1 0�
    0 1
    e
    b
    Calculate the syndrome vector for single bit errors.

    a p
    rp
    8. (a) The generator matrix of a linear binary code is:
    0 0 1 1 1 0 1
    𝐺𝐺 = �0 1 0 0 1 1 1�
    1 0 0 1
    (i) Express G in symmetric form
    1

    (ii) Determine the parity check matrix for the code


    b
    1 0

    (iii) Construct Syndrome table


    (iv) Determine minimum distance of the code

    (b) Write the steps to compute the checksum in CRC code. Calculate CRC for the frame
    110101011 and the generator polynomial = x4 + x +1 and write the transmitted frame.

    9. Consider the convolutional encoder as shown below and for a received signal Y= 11 01 11.
    Show the first three branches of the valid paths emerging from the initial node a 0 in the code
    trellis.

    | M71236 Page 2 of 2

    You might also like