Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Ect303 Digital Signal Processing, December 2022

    Uploaded by

    Dinil Dhananjayan
    This document contains a digital signal processing exam with 20 questions across 5 modules. The exam assesses students' knowledge of key DSP concepts like the discrete Fourier transform (DFT), finite impulse response (FIR) and infinite impulse response (IIR) filters, fast Fourier transform (FFT) algorithms, filter design techniques, and DSP processor architectures. Some of the questions ask students to derive signal processing equations, analyze filters, design filters meeting specific specifications, explain DSP concepts and algorithms, and compare different implementations. The exam tests students' understanding of signals and systems, filtering, spectral analysis, sampling, and practical DSP applications.

    Copyright:

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

    Ect303 Digital Signal Processing, December 2022

    Uploaded by

    Dinil Dhananjayan
    22 views3 pages
    This document contains a digital signal processing exam with 20 questions across 5 modules. The exam assesses students' knowledge of key DSP concepts like the discrete Fourier transform (DFT), finite impulse response (FIR) and infinite impulse response (IIR) filters, fast Fourier transform (FFT) algorithms, filter design techniques, and DSP processor architectures. Some of the questions ask students to derive signal processing equations, analyze filters, design filters meeting specific specifications, explain DSP concepts and algorithms, and compare different implementations. The exam tests students' understanding of signals and systems, filtering, spectral analysis, sampling, and practical DSP applications.

    Original Description:

    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 a digital signal processing exam with 20 questions across 5 modules. The exam assesses students' knowledge of key DSP concepts like the discrete Fourier transform (DFT), finite impulse response (FIR) and infinite impulse response (IIR) filters, fast Fourier transform (FFT) algorithms, filter design techniques, and DSP processor architectures. Some of the questions ask students to derive signal processing equations, analyze filters, design filters meeting specific specifications, explain DSP concepts and algorithms, and compare different implementations. The exam tests students' understanding of signals and systems, filtering, spectral analysis, sampling, and practical DSP applications.

    Copyright:

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

    Ect303 Digital Signal Processing, December 2022

    Uploaded by

    Dinil Dhananjayan
    This document contains a digital signal processing exam with 20 questions across 5 modules. The exam assesses students' knowledge of key DSP concepts like the discrete Fourier transform (DFT), finite impulse response (FIR) and infinite impulse response (IIR) filters, fast Fourier transform (FFT) algorithms, filter design techniques, and DSP processor architectures. Some of the questions ask students to derive signal processing equations, analyze filters, design filters meeting specific specifications, explain DSP concepts and algorithms, and compare different implementations. The exam tests students' understanding of signals and systems, filtering, spectral analysis, sampling, and practical DSP applications.

    Copyright:

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

    B 1100ECT303L22204

    t4

    f/
    F-l
    Reg No.:

    APJ ABDUL KI.LAM TECHNOLOGICAL UNryERSITY


    Fifth Semester B.Tech Degree Regular and Supplementary Examination Dec 2022 (20

    Course Code: ECT 303


    Course Name: DIGITAL SIGNAL PROCESSING

    Max. Marks: 100 Duration:3 Hours

    PART A
    (Answer all questions; each question carries 3 marks) Marks

    Compute the DFT of the sequence x[n] : (j)" Ui=rtd(n - /c))l a


    J

    Explain Digital signal processing system with a block diagram. J

    Discuss the need for FFT. Justify your answer in terms of computational J

    complexity, memory requirement etc.


    4 Find the DFT of the sequence using DIT FFT algorithm x[n] : { l, -1, 0} a
    J

    5 Compare FIR and IIR filters. J


    a
    6 Analog transfer function of a digital filter is given by (") = *. Comment J

    on the stability of the filter. Obtain the digital transfer function of the same
    using impulse invariance method. Where sampling time is T.
    What is Multirate signal processing? Obtain interpolated and decimated
    versions for the sequence x[n] : {1, 2, 3, 4, 5, 6, 7, 8} by a factor 2.
    I
    8 Obtain the direct form structure for the FIR filter with transfer function J

    H(z) = I.* 2z-1 * 3z-2 * 4z-3 * ;z-a I 6z-6 * 7z-7


    a
    9 What is meant by pipelining? Give its significance in DSP processors. J

    "10 The effect of ADC quantization noiq=e plays very important role in DSP r3
    processors. Justifu.

    (Answer onefull qaestionfro* *r"fffii*, each question corries 14 marks)

    Module -1
    I I a) State the following properties of DFT (i) Linearity (ii) Time Reversal
    (iii) Parseval's theorem
    b) Jllustrate the concept of circular convolution property of a DFT sequence
    for the discrete time sequences x[n] : {1,2, I, 2}, h[n] : {2, 4, 6,8}

    Page 1 of 3
    11008CT303122204

    12 a) What is the significance of zero padding? If number of zeros are padded on 6

    (i) Left of the signal (ii) Right of the signal. Comment on its effect on the
    sPectrum.

    b) Find the linear convolution sum of the sequence x[n] = {1,2, -1,2,3, -2, 8

    -3, -L, l, 1,2, -l ) and h[n] : {1,2\ using overlap add method'
    Module -2
    - 13 a) Write down the principle of in-place computation in FFT. 4

    b) Compute the IDFT of the sequence X[k] = {1, -1, l, -1, 1, -1, l, -1} using l0
    DIT algorithm.
    14 a) Explain the principle of DIF FFT algorithm and obtain the final flow graph 10

    for the same.


    ,.
    b) Findthe4-pointDFTof sequencesx[n]: {1,2,0' l} and 4

    y[n] : {2,2,1,1} by computing the 4-point DFT only once'


    Module -3
    15 a) Design a Butterworth filter using bilinear transformation. l0

    Specifications of desired LPF are


    n
    0.707<lH(w)l <1; 0t*'Z
    3TI
    lH(w)l < 0.2, 4 =w 3II
    Given that T= I sec.
    4
    t'
    b) Explain Gibbs Phenomenon.
    16 a) Forthe desired frequency response 8

    (.^3n3n
    ----:- Ha(a) = < a <Z'
    le-t",-T
    ( 0, otherwise
    Y Determine for N = 7 using rectangular window. t
    b) Explain the principle of fr.qu.nry*?rnpling technique for FIR filter 6

    design.
    Module -4
    17 a) Obtain direct form I, direct form II and parallel form structure for the 10

    system
    L7
    - t) + |t(n - 2) + x(n) + x(n - L)
    y(n) =
    1t("
    b) Write a short note on anti-aliasing filter and anti-imaging filter 4

    Page 2 of 3
    *,
    tr#csmt?;E's4

    l8 a) Obtainthe casc* fsm relisatioarsing dircct fs.m II 7

    H(z) =
    r 2+z-1 +z-2

    b) Write down the principle of line,ar phsse in FIR filts with a struchue. 7

    Moduh -5
    19 a) With a detailed block diag.attu explain the architecture of typioal DSF l0
    proccssor family TMS3 2rc67XX.
    s., Writc a short note on truncation and rounding with examples? 4
    2$ a) fu are the variqrs data form*s in DSP pnocessors? Exphia wifh t
    sui8t*e o<amples.
    b) MAC # .'kt sfffi P processor. Justiff .

    'l

    Page3d3

    You might also like