Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    Internal Test-I Set 1 - DSP

    Uploaded by

    Anonymous Ndsvh2so
    1. The document is an exam paper for the subject Discrete Time Signal Processing. It contains 2 parts - Part A with 10 multiple choice questions worth 2 marks each and Part B with 2 long answer questions worth 15 marks each. 2. Part A questions test different cognitive levels related to DFT, DIT and DIF FFT algorithms, applications of FFT, butterfly diagrams, and differences between linear and circular convolution. 3. Part B questions involve calculating IDFT, using DIT FFT algorithm, linear convolution using overlap add and overlap save methods, and estimating DFT. The questions aim to assess understanding and application of concepts from the subject.

    Copyright:

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

    Internal Test-I Set 1 - DSP

    Uploaded by

    Anonymous Ndsvh2so
    42 views2 pages
    1. The document is an exam paper for the subject Discrete Time Signal Processing. It contains 2 parts - Part A with 10 multiple choice questions worth 2 marks each and Part B with 2 long answer questions worth 15 marks each. 2. Part A questions test different cognitive levels related to DFT, DIT and DIF FFT algorithms, applications of FFT, butterfly diagrams, and differences between linear and circular convolution. 3. Part B questions involve calculating IDFT, using DIT FFT algorithm, linear convolution using overlap add and overlap save methods, and estimating DFT. The questions aim to assess understanding and application of concepts from the subject.

    Original Description:

    nbm,

    Original Title

    internal test-I set 1- dsp

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document is an exam paper for the subject Discrete Time Signal Processing. It contains 2 parts - Part A with 10 multiple choice questions worth 2 marks each and Part B with 2 long answer questions worth 15 marks each. 2. Part A questions test different cognitive levels related to DFT, DIT and DIF FFT algorithms, applications of FFT, butterfly diagrams, and differences between linear and circular convolution. 3. Part B questions involve calculating IDFT, using DIT FFT algorithm, linear convolution using overlap add and overlap save methods, and estimating DFT. The questions aim to assess understanding and application of concepts from the subject.

    Copyright:

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

    Internal Test-I Set 1 - DSP

    Uploaded by

    Anonymous Ndsvh2so
    1. The document is an exam paper for the subject Discrete Time Signal Processing. It contains 2 parts - Part A with 10 multiple choice questions worth 2 marks each and Part B with 2 long answer questions worth 15 marks each. 2. Part A questions test different cognitive levels related to DFT, DIT and DIF FFT algorithms, applications of FFT, butterfly diagrams, and differences between linear and circular convolution. 3. Part B questions involve calculating IDFT, using DIT FFT algorithm, linear convolution using overlap add and overlap save methods, and estimating DFT. The questions aim to assess understanding and application of concepts from the subject.

    Copyright:

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

    Reg.

    No:

    MAHENDRA COLLEGE OF ENGINEERING


    Salem-Campus, Attur Main Road, Minnampalli, Salem -636 106.

    Class: III/V (ECE) 1 Hr. 30


    Time :
    Min.
    Date: 24.07.2019
    Subject
    EC8553
    Code:
    Marks : 50
    Subject
    DISCRETE TIME SIGNAL PROCESSING
    Name:

    Blooms
    S. Course
    Question Taxonomy
    No Outcomes
    Level
    Answer All Questions

    Part A— (10 X 2=20)

    1 Find the DFT of the following (i) x(n)=δ(n), (ii) x(n)=an Remembering CO1

    2 Compute the DFT of the sequence X(n) ={1,1,0,0} Analyzing CO1

    Calculate the number of multiplication needed in the calculation of


    3 Evaluating CO1
    DFT and FFT with 64 point sequence.

    4 Compare the DIT and DIF radix-2 FFT Analyzing CO1

    5 Find the values of Wnk , when N=8 and K=2 and also for K=3 Remembering CO1

    6 What are the applications of FFT Algorithm. Applying CO1

    7 Draw the basic butterfly diagram of radix -2 DIT FFT. Understanding CO1

    8 Difference between Linear Convolution and Circular Convolution. Creating CO1

    9 What is DIT algorithm? Understanding CO1

    10 What is meant by radix-2 FFT? Remembering CO1


    Part B — (02 X 15=30)
    11.a) Calculate IDFT of the sequence
    Understandin
    X(K)={7,−0.707−j0.707,−j,0.707−0.707,1,0.707+j0.707,j, [15] CO1
    g
    −0.707+j0.707}
    [OR]
    11.b Evaluate the 8 point for the given sequence using DIT FFT [15 Analyzing CO1
    algorithm ]
    𝑥(𝑛)={1, 𝑓𝑜𝑟 −3≤𝑛≤3
    { 0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

    12.a) Using linear convolution construct 𝑦(𝑛)=𝑥(𝑛)∗ℎ(𝑛) for the [15] Understanding CO1
    sequence 𝑥(𝑛)={1,2,−1,2,3,−2,−3,−1,1,1,2,−1} and ℎ(𝑛)={1,2}.
    Compare the result by solving the problem using Overlap add
    method & Overlap save method.

    [OR]
    12.b) Estimate the DFT of the sequence 𝑥(𝑛)={1,1,1,0,0,0,2,2} [15] Remembering CO1
    ↑

    Subject Teacher HOD- ECE Dean-Academics

    You might also like