Scribd Logo
Upload

Welcome to Scribd!

  • 47 views

    DSP Question Bank

    Uploaded by

    Salai Kishwar Jahan
    This document contains questions from the DSP question bank for Unit 1 on the Discrete Fourier Transform (DFT). It includes 10 short answer questions on topics like the Fast Fourier Transform (FFT), bit reversal, DFT, IDFT, circular convolution, and butterfly diagrams. It also includes 3 longer form questions: 1) explaining Radix-2 DIF FFT for N=8 and computing an example, 2) explaining how to compute the IDFT using Radix-2 Butterfly FFT, and 3) deriving the equation for DIT algorithm and stating a property of DFT.

    Copyright:

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

    DSP Question Bank

    Uploaded by

    Salai Kishwar Jahan
    47 views2 pages
    This document contains questions from the DSP question bank for Unit 1 on the Discrete Fourier Transform (DFT). It includes 10 short answer questions on topics like the Fast Fourier Transform (FFT), bit reversal, DFT, IDFT, circular convolution, and butterfly diagrams. It also includes 3 longer form questions: 1) explaining Radix-2 DIF FFT for N=8 and computing an example, 2) explaining how to compute the IDFT using Radix-2 Butterfly FFT, and 3) deriving the equation for DIT algorithm and stating a property of DFT.

    Original Description:

    In this document provided the important questions for DSP and also it is very easy .

    Original Title

    Dsp Question bank

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains questions from the DSP question bank for Unit 1 on the Discrete Fourier Transform (DFT). It includes 10 short answer questions on topics like the Fast Fourier Transform (FFT), bit reversal, DFT, IDFT, circular convolution, and butterfly diagrams. It also includes 3 longer form questions: 1) explaining Radix-2 DIF FFT for N=8 and computing an example, 2) explaining how to compute the IDFT using Radix-2 Butterfly FFT, and 3) deriving the equation for DIT algorithm and stating a property of DFT.

    Copyright:

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

    DSP Question Bank

    Uploaded by

    Salai Kishwar Jahan
    This document contains questions from the DSP question bank for Unit 1 on the Discrete Fourier Transform (DFT). It includes 10 short answer questions on topics like the Fast Fourier Transform (FFT), bit reversal, DFT, IDFT, circular convolution, and butterfly diagrams. It also includes 3 longer form questions: 1) explaining Radix-2 DIF FFT for N=8 and computing an example, 2) explaining how to compute the IDFT using Radix-2 Butterfly FFT, and 3) deriving the equation for DIT algorithm and stating a property of DFT.

    Copyright:

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

    DSP QUESTION BANK

    UNIT-I DISCRETE FOURIERS TRANSFORM

    Part-A (2 Marks)
    1) Define FFT.
    2) Determine the DFT of a sequence x(n)=anu(n).
    3) What are the advantages of FFT over direct computation of
    DFT?
    4) What do you mean by the term Bit reversal as applied
    FFT?
    5) Define DFT & IDFT.
    6) How do you calculate the circular convolution using FFT?
    7) Draw Butterfly diagram of DIT & DIT.
    8) Define linear filtering.
    9) Compare DIT and DIF.
    10) Compute the DIF for x(n)=1,0,1,0.

    Part-B(16 Marks)
    1) (i) Explain Radix-2 DIF FFT for N=8.(8)

    (ii) Compute the FFT for N=8 x(n)= 1,-1,1,-1,2,-2,2,-2.(8)

    2) Explain how to compute the IDFT using Radix-2 Butterfly


    FFT algorithm.(16)
    3) (i) Derive the equation for DIT algorithm.(12)
    (ii) State the propert of DFT.(4)

    You might also like