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

Welcome to Scribd!

  • 73 views

    C F1048 Pages:2: Answer Any Two Full Questions, Each Carries 15 Marks

    Uploaded by

    Glan Devadhas
    This document appears to be an exam for a Digital Signal Processing course. It contains 9 questions across 3 sections. The questions cover topics such as: 1) finding the discrete Fourier transform and Z-transform of sequences, 2) sampling theory, 3) designing digital filters using techniques like bilinear transform and windowing, 4) realizing filter structures for given transfer functions, 5) architectures for digital signal processors like von Neumann and Harvard, and 6) effects of quantization, rounding, and truncation in digital filters.

    Copyright:

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

    C F1048 Pages:2: Answer Any Two Full Questions, Each Carries 15 Marks

    Uploaded by

    Glan Devadhas
    73 views2 pages
    This document appears to be an exam for a Digital Signal Processing course. It contains 9 questions across 3 sections. The questions cover topics such as: 1) finding the discrete Fourier transform and Z-transform of sequences, 2) sampling theory, 3) designing digital filters using techniques like bilinear transform and windowing, 4) realizing filter structures for given transfer functions, 5) architectures for digital signal processors like von Neumann and Harvard, and 6) effects of quantization, rounding, and truncation in digital filters.

    Original Title

    AE306-C.pdf

    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 appears to be an exam for a Digital Signal Processing course. It contains 9 questions across 3 sections. The questions cover topics such as: 1) finding the discrete Fourier transform and Z-transform of sequences, 2) sampling theory, 3) designing digital filters using techniques like bilinear transform and windowing, 4) realizing filter structures for given transfer functions, 5) architectures for digital signal processors like von Neumann and Harvard, and 6) effects of quantization, rounding, and truncation in digital filters.

    Copyright:

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

    C F1048 Pages:2: Answer Any Two Full Questions, Each Carries 15 Marks

    Uploaded by

    Glan Devadhas
    This document appears to be an exam for a Digital Signal Processing course. It contains 9 questions across 3 sections. The questions cover topics such as: 1) finding the discrete Fourier transform and Z-transform of sequences, 2) sampling theory, 3) designing digital filters using techniques like bilinear transform and windowing, 4) realizing filter structures for given transfer functions, 5) architectures for digital signal processors like von Neumann and Harvard, and 6) effects of quantization, rounding, and truncation in digital filters.

    Copyright:

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

    C F1048 Pages:2

    Reg No.:_______________ Name:__________________________


    APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
    SIXTH SEMESTER B.TECH DEGREE EXAMINATION(R&S), MAY 2019
    Course Code: AE306
    Course Name: DIGITAL SIGNAL PROCESSING
    Max. Marks: 100 Duration: 3 Hours

    PART A
    Answer any two full questions, each carries 15 marks. Marks

    1 a) Find the DFT of a sequence x(n)={1,2,3,4,4,3,2,1} using DIT algorithm. (8)


    b) Check if all the roots of the characteristic equation z3+0.25z2+ z+0.25=0 lie within (7)
    the unit circle using Jury’s test.
    2 a) State and explain sampling theorem (3)
    b) Find the nyquist rate of x(t)=sin 400πt+cos2500𝜋𝑡 (4)
    c) Determine the Z transform and ROC of (8)
    I. x1(n) = (2)n cosωn
    II. x2(n) = nu(n).
    3 a) Find the DTFT of x(n)=a|n| (3)
    b) 𝑧 (9)
    Find the inverse Z transform of X(z)= 1 for all possible ROC’s.
    (𝑧−2)(𝑧−2)

    c) Compare the computational complexities of DFT computation for N=16 using DIT (3)
    FFT and direct method.

    PART B
    Answer any two full questions, each carries 15 marks.
    4 a) Design an ideal digital differentiator with frequency response (7)
    Hd(ejω)=jω for -𝜋 ≤ω ≤π using rectangular window with N=8
    b) 2 (8)
    For the analog transfer function H(s)= , determine H(z) using impulse
    (𝑠+1)(𝑠+2)
    invariance method (Assume T=1 sec)
    a) Using bilinear transform, design a high pass filter, monotonic in pass band with cut (10)
    5 off frequency of 1000Hz, αp=3dB and, αs=10dB at 350Hz. The sampling frequency
    is 5000Hz
    b) Design an ideal low pass FIR filter with Hd(ejω)=1 for -𝜋 ≤ω ≤𝜋 (5)
    2 2
    𝜋
    = 0 for 2
    ≤|ω| ≤ π
    Find h(n) for L=11 using direct truncation

    Page 1of 2
    C F1048 Pages:2

    6 a) Explain the classification of linear phase FIR filter (10)


    b) Given the specification αp=1dB, αs=30dB, Ωp=200 rad/sec and, Ωs=600 rad/sec. (5)
    Determine the order of the filter.

    PART C
    Answer any two full questions, each carries 20 marks.
    7 a) Obtain the direct form I, direct form II, cascade and parallel realization of the
    1 (10)
    1+3𝑧 −1
    system H(z)= 3 1
    1−4𝑧 −1 +8𝑧 −2

    b) Draw and explain the architecture of TMS 320C 5X (10)


    8 a) Explain the von-Neumann architecture with a neat block diagram. (10)
    b) Realize the following FIR system function using minimum number of multipliers (5)
    1 1 1 1
    H(z)={1+2 𝑧 −1 +2 𝑧 −2 + 3 𝑧 −3 }{1 + 3 𝑧 −1 }

    c) Explain the fixed point and floating point representation of numbers (5)
    9 a) Explain (10)
    I. Harvard architecture
    II. Pipelining
    b) Explain the effects of quantization and round off in digital filter coefficients (6)
    c) Explain the errors resulting from rounding and truncating (4)
    ****

    Page 2of 2

    You might also like