Scribd Logo
Upload

Welcome to Scribd!

  • 28 views

    X (N) (1,2,1) H (N) (1, - 2,2)

    Uploaded by

    mugaao8
    This document is an internal assessment for a course on discrete-time signal processing. It contains 13 multiple choice and numerical response questions assessing various topics covered in the course. The questions cover the basic structure of the discrete Fourier transform algorithm, computations of DFTs and IDFTs, properties of the DFT, zero padding, circular convolution using DFT/IDFT, design of digital filters using impulse invariant transformation and bilinear transformation techniques. The assessment is divided into three parts with questions of varying difficulty levels testing different cognitive domains such as remembering, understanding, and applying course concepts.

    Copyright:

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

    X (N) (1,2,1) H (N) (1, - 2,2)

    Uploaded by

    mugaao8
    28 views2 pages
    This document is an internal assessment for a course on discrete-time signal processing. It contains 13 multiple choice and numerical response questions assessing various topics covered in the course. The questions cover the basic structure of the discrete Fourier transform algorithm, computations of DFTs and IDFTs, properties of the DFT, zero padding, circular convolution using DFT/IDFT, design of digital filters using impulse invariant transformation and bilinear transformation techniques. The assessment is divided into three parts with questions of varying difficulty levels testing different cognitive domains such as remembering, understanding, and applying course concepts.

    Original Title

    bt_DTSP _retest

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is an internal assessment for a course on discrete-time signal processing. It contains 13 multiple choice and numerical response questions assessing various topics covered in the course. The questions cover the basic structure of the discrete Fourier transform algorithm, computations of DFTs and IDFTs, properties of the DFT, zero padding, circular convolution using DFT/IDFT, design of digital filters using impulse invariant transformation and bilinear transformation techniques. The assessment is divided into three parts with questions of varying difficulty levels testing different cognitive domains such as remembering, understanding, and applying course concepts.

    Copyright:

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

    X (N) (1,2,1) H (N) (1, - 2,2)

    Uploaded by

    mugaao8
    This document is an internal assessment for a course on discrete-time signal processing. It contains 13 multiple choice and numerical response questions assessing various topics covered in the course. The questions cover the basic structure of the discrete Fourier transform algorithm, computations of DFTs and IDFTs, properties of the DFT, zero padding, circular convolution using DFT/IDFT, design of digital filters using impulse invariant transformation and bilinear transformation techniques. The assessment is divided into three parts with questions of varying difficulty levels testing different cognitive domains such as remembering, understanding, and applying course concepts.

    Copyright:

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

    THENI KAMMAVAR SANGAM COLLEGE OF TECHNOLOGY

    KODUVILARPATTI, THENI – 625 534


    DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
    INTERNAL ASSESSMENT I
    Branch/Year/Sem/Sec : ECE/III/V Date : 16.08.19
    Subject Code/Name : EC8553/ Discrete-Time Signal Processing
    Time : 1.30 Hrs Max. Marks : 50
    Answer All Questions
    PART – A (10×2=20) BT CO
    Level
    1. Draw the basic basic structure of DIT algorithm. 4 1
    2. How many multiplications and additions are required to compute N-point 4 1
    DFT using radix-2 FFT and DFT?
    3. What is twiddle factor? 2 1
    4. What is relationship between DFT and Z-transform? 4 1
    5. Write the DFT and IDFT for an N-point sequence. 1 1
    6. Compute the DFT of the sequence x(n)={1,0,1,0}. 3 1
    7. What is zero padding? What are its uses? 1 2
    8. Obtain the circular convolution of the following sequences 1 2
    x(n) = {1,2,1}; h(n) ={1, -2,2}
    9. Given that, H(s)=1/(s+2). By impulse invariant method obtain the digital 3 2
    filter function
    10. Sketch the frequency response of an odd and even order butterworth filter. 4 2
    PART – B (3X10= 30)
    11. (a) Compute the 8 point DFT for the following sequences using (10) 3 1
    DIT – FFT algorithm x(n)={ 1/2 ; 0 < n < 3
    0 ; else.
    (OR)
    (b) Compute IDFT of the sequence X(K)={7, -0.707+j0.707, -j , (10) 3 1
    0.707+j0.707, 1, 0.707-j0.707, j, - 0.707-j0.707} using DIF
    algorithm.

    12. (a) (i) Explain the IIR design using Bilinear Transformation (5) 2 2
    techniques
    (ii) State and Prove any two properties of DFT (5) 1 1
    (OR)
    (b) Compute find the circular convolution of the following two (10) 3 1
    sequences using DFT and IDFT. X 1(n) ={1,0,2,0}and X2(n)
    ={1,1,3,3}.
    PART – C (1×10= 10)
    13. (a) Design Butterworth digital filter using impulse invariant (10) 3
    transformation that satisfy the following specification 2
    0.707 < |H(w)| < 1.0; 0 < w < π/2
    |H(w)| < 0.2; 3π/4 < w < π
    (OR)
    (b) The specification of the desired low pass filter is (10) 3 2
    0.8 < |H(w)| < 1.0; 0 < w < 0.2π
    |H(w)| < 0.2; 0.6π < w < π
    Design Chebyshev digital filter using bilinear
    Transformation.
    ----------------------------------------------
    BT Level: 1- Remembering, 2- Understanding, 3- Applying, 4- Analyzing

    STAFF IN-CHARGE HOD

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy