Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 15 views

    Gujarat Technological University

    Uploaded by

    yicef37689
    This document is an exam for a digital signal processing course. It contains 5 questions assessing various topics in digital signal processing. Question 1 covers the sampling theorem, classification of discrete time systems, and circular convolution. Question 2 covers time variance, linearity, autocorrelation, and zero input response. Question 3 covers initial and final value theorems in Z-transforms, deriving Z-transforms, and inverse Z-transforms. Question 4 covers the DFT, impulse invariance, linear phase FIR filters, and lattice structures. Question 5 covers the IDFT, Parseval's theorem, decimation in time FFT, and decimation in frequency FFT.

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    yicef37689
    15 views2 pages
    This document is an exam for a digital signal processing course. It contains 5 questions assessing various topics in digital signal processing. Question 1 covers the sampling theorem, classification of discrete time systems, and circular convolution. Question 2 covers time variance, linearity, autocorrelation, and zero input response. Question 3 covers initial and final value theorems in Z-transforms, deriving Z-transforms, and inverse Z-transforms. Question 4 covers the DFT, impulse invariance, linear phase FIR filters, and lattice structures. Question 5 covers the IDFT, Parseval's theorem, decimation in time FFT, and decimation in frequency FFT.

    Original Title

    2171708

    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 is an exam for a digital signal processing course. It contains 5 questions assessing various topics in digital signal processing. Question 1 covers the sampling theorem, classification of discrete time systems, and circular convolution. Question 2 covers time variance, linearity, autocorrelation, and zero input response. Question 3 covers initial and final value theorems in Z-transforms, deriving Z-transforms, and inverse Z-transforms. Question 4 covers the DFT, impulse invariance, linear phase FIR filters, and lattice structures. Question 5 covers the IDFT, Parseval's theorem, decimation in time FFT, and decimation in frequency FFT.

    Copyright:

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

    Gujarat Technological University

    Uploaded by

    yicef37689
    This document is an exam for a digital signal processing course. It contains 5 questions assessing various topics in digital signal processing. Question 1 covers the sampling theorem, classification of discrete time systems, and circular convolution. Question 2 covers time variance, linearity, autocorrelation, and zero input response. Question 3 covers initial and final value theorems in Z-transforms, deriving Z-transforms, and inverse Z-transforms. Question 4 covers the DFT, impulse invariance, linear phase FIR filters, and lattice structures. Question 5 covers the IDFT, Parseval's theorem, decimation in time FFT, and decimation in frequency FFT.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Seat No.: ________ Enrolment No.

    ___________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE - SEMESTER– VII (NEW) EXAMINATION – WINTER 2021
    Subject Code:2171708 Date:25/11/2021
    Subject Name:Digital Signal Processing
    Time:02:30 PM TO 05:00 PM Total Marks: 70
    Instructions:
    1. Attempt all questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.
    4. Simple and non-programmable scientific calculators are allowed.

    MARKS

    Q.1 (a) Explain sampling theorem in detail. 03


    (b) Classify discrete time systems with respective supportive details. 04

    (c) Perform the circular convolution of two sequence 07


    x1(n) = {1,3,5,3} and x2(n) ={2,3,1,1}

    Q.2 (a) Check the time variance of given systems. 03


    1. y(n) = x(n) cosw0n 2. y(n) = x(n) u(n)

    (b) Check the linearity of given systems. 04


    1. y(n) = x(n) cosw0n 2. y(n) = x(n) u(n)

    (c) Determine rxy (l) and ryx (l) of given sequences. 07


    x(n) = {-3, -2, 1, 4, 8, -3} y(n) = {1, 1, 1, -1, 2, -2}
    ↑ ↑
    OR
    (c) Determine zero input response of system described by homogeneous second 07
    order difference equation
    y(n) - 3 y(n-1) - 4 y(n-2) = 0.

    Q.3 (a) State and explain initial and final value theorem in Z transformation. 03

    (b) Derive the Z transformation for x(n) = an (sinw0n) u(n) 04

    (c) Determine inverse Z transformation by power series expansion method. 07


    X(z) =1/(1 -1.5 z -1 +0.5 z -2)
    For ROC ǀzǀ >1 and ROC ǀzǀ <0.5
    OR
    Q.3 (a) Determine causality of the given systems. 03
    1. x(n) = x(n-5) 2. x(n) = x(n+5) 3. x(n) = x(-n)

    (b) Determine Z transformation of Signal x(n) = n an u(n) 04

    (c) List out the properties of Z transformation with suitable detail. 07

    Q.4 (a) Compute the DFT of sequence x(n) = 1/3 (for 0 ≤ n ≤ 2 and zero elsewhere) 03

    (b) Explain impulse invariance method. 04

    (c) Explain linear phase FIR structure with necessary sketch and derivations. 07
    1
    OR
    Q.4 (a) Compute the DFT of sequence x(n) = {1, 0, 0, 1} 03
    ↑

    (b) Explain bilinear transformation method. 04

    (c) Explain lattice structure for IIR system with necessary sketch and derivations. 07

    Q.5 (a) Detrmine the IDFT of X[k] = {2, 1+j, 0, 1-j} 03

    (b) Explain parseval's theorem for DFT. 04

    (c) Enumerate 8 point decimation in time FFT algorithm. 07


    OR
    Q.5 (a) Explain time reversal of a sequence in DFT. 03

    (b) Explain symmetry properties of DFT for real and odd as well as real and 04
    even sequences.

    (c) Enumerate 8 point decimation in frequency FFT algorithm. 07

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

    You might also like