Scribd Logo
Upload

Welcome to Scribd!

  • 54 views

    Gujarat Technological University

    Uploaded by

    Virang Patel
    This document contains instructions for an exam on digital communication. It lists 5 questions, each with 2 parts worth 7 marks each. Question 1 covers defining random variables and explaining Nyquist's sampling theorem. Question 2 involves deriving channel capacity and calculating entropies for a binary channel. Question 3 is about line coding and delta modulation. Question 4 derives bit error rates for optimal binary receivers and ASK. Question 5 involves linear block codes, constructing a cyclic code, and explaining QPSK and convolutional coding.

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    Virang Patel
    54 views2 pages
    This document contains instructions for an exam on digital communication. It lists 5 questions, each with 2 parts worth 7 marks each. Question 1 covers defining random variables and explaining Nyquist's sampling theorem. Question 2 involves deriving channel capacity and calculating entropies for a binary channel. Question 3 is about line coding and delta modulation. Question 4 derives bit error rates for optimal binary receivers and ASK. Question 5 involves linear block codes, constructing a cyclic code, and explaining QPSK and convolutional coding.

    Original Description:

    question paper gtu

    Original Title

    2161001

    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 contains instructions for an exam on digital communication. It lists 5 questions, each with 2 parts worth 7 marks each. Question 1 covers defining random variables and explaining Nyquist's sampling theorem. Question 2 involves deriving channel capacity and calculating entropies for a binary channel. Question 3 is about line coding and delta modulation. Question 4 derives bit error rates for optimal binary receivers and ASK. Question 5 involves linear block codes, constructing a cyclic code, and explaining QPSK and convolutional coding.

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    Virang Patel
    This document contains instructions for an exam on digital communication. It lists 5 questions, each with 2 parts worth 7 marks each. Question 1 covers defining random variables and explaining Nyquist's sampling theorem. Question 2 involves deriving channel capacity and calculating entropies for a binary channel. Question 3 is about line coding and delta modulation. Question 4 derives bit error rates for optimal binary receivers and ASK. Question 5 involves linear block codes, constructing a cyclic code, and explaining QPSK and convolutional coding.

    Copyright:

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

    Seat No.

    : ________

    Enrolment No.___________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE - SEMESTERVI (NEW) - EXAMINATION SUMMER 2016

    Subject Code:2161001
    Subject Name: Digital Communication
    Time: 10:30 AM to 01:00 PM

    Date:06/05/2016
    Total Marks: 70

    Instructions:
    1. Attempt all questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.

    Q.1

    Q.2

    (a) Define random variable and find the mean, the mean square and the variance of
    the general Gaussian random variable.
    (b) Explain briefly Nyquists sampling theorem. What is Interpolation process?
    Derive Interpolation formula.

    07

    (a) Derive channel capacity C if channel noise is additive, white Gaussian with mean
    square value N, given signal power S.
    (b) A binary channel matrix is given by
    y1
    y2
    x1 2/3 1/3
    x1,x2=input y1,y2=output
    x2 1/10 9/10

    07

    Px(x1)=1/3 and Px(x2)=2/3. Determine H(X), H(Y), H(X/Y), H(Y/X) and I(X;Y).
    OR
    (b) A zero-memory source emits messages m1 and m2 with probabilities 0.8 and0.2,
    respectively. Find the optimum (Huffman) binary code for this source as well as
    for its second - and third order extension (that is, for N = 2 and 3).Determine
    the code efficiencies in each code.
    Q.3

    Q.3

    Q.4

    Q.4

    Q.5

    07

    07

    07

    (a) What is line coding? What are the ideal requirements from line coding?
    Draw waveform of bipolar AMI coding for the sequence 10100101.
    (b) Explain Delta Modulation in detail. Also discuss its advantages and
    disadvantages.
    OR
    (a) What is Inter Symbol Interference? Explain the Nyquists first criteria for zero
    ISI.
    (b) What are the functions of regenerative repeater? Fully Explain the zero forcing
    equalizer with expressions.

    07

    (a) Derive the general expression of Bit Error Rate (BER) for Optimum Binary
    Receiver.
    (b) For ASK modulated signal, derive the expression of bit error probability using
    non-coherent detection.
    OR
    (a) What is the multi-amplitude signalling? Derive the BER for the same using
    matched-filter receiver.
    (b) Explain mathematical and graphical representation of BPSK. Explain BPSK
    generation.

    07

    (a) Explain the generation of linear block code using suitable example.
    (b) 1. Construct the systematic (7,4) cyclic code using the generator polynomial
    g(x)=x3+x+1
    2. What are the error correcting capabilities of this code?
    3. Construct the decoding table.

    07
    07

    07

    07
    07

    07

    07
    07

    Q.5

    4. If the received word is 1101100, determine the transmitted data word.


    OR
    (a) Explain QPSK with waveforms, constellation diagram and mathematical
    representation.
    (b) Write short note on Convolutional coding.

    07
    07

    *************

    You might also like