Scribd Logo
Upload

Welcome to Scribd!

  • 72 views

    One Mark Questions:: EC431 Digital Signal Processing Unit-II

    Uploaded by

    Uday Kiran Muddana
    The document contains questions related to digital signal processing topics like the discrete Fourier transform (DFT), discrete-time Fourier transform (DTFT), Z-transform, circular convolution, linear convolution, and fast Fourier transform (FFT) algorithms. Specifically, it includes: - One mark questions testing basic understanding of properties, definitions and relationships between DFT, DTFT, Z-transform, circular and linear convolution. - Ten mark questions involving derivations, proofs of properties, computations of DFT/DTFT and use of FFT algorithms to efficiently compute DFT, as well as overlap-add and overlap-save methods for long sequence filtering.

    Copyright:

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

    One Mark Questions:: EC431 Digital Signal Processing Unit-II

    Uploaded by

    Uday Kiran Muddana
    72 views3 pages
    The document contains questions related to digital signal processing topics like the discrete Fourier transform (DFT), discrete-time Fourier transform (DTFT), Z-transform, circular convolution, linear convolution, and fast Fourier transform (FFT) algorithms. Specifically, it includes: - One mark questions testing basic understanding of properties, definitions and relationships between DFT, DTFT, Z-transform, circular and linear convolution. - Ten mark questions involving derivations, proofs of properties, computations of DFT/DTFT and use of FFT algorithms to efficiently compute DFT, as well as overlap-add and overlap-save methods for long sequence filtering.

    Original Description:

    Micro waves

    Original Title

    Micro

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains questions related to digital signal processing topics like the discrete Fourier transform (DFT), discrete-time Fourier transform (DTFT), Z-transform, circular convolution, linear convolution, and fast Fourier transform (FFT) algorithms. Specifically, it includes: - One mark questions testing basic understanding of properties, definitions and relationships between DFT, DTFT, Z-transform, circular and linear convolution. - Ten mark questions involving derivations, proofs of properties, computations of DFT/DTFT and use of FFT algorithms to efficiently compute DFT, as well as overlap-add and overlap-save methods for long sequence filtering.

    Copyright:

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

    One Mark Questions:: EC431 Digital Signal Processing Unit-II

    Uploaded by

    Uday Kiran Muddana
    The document contains questions related to digital signal processing topics like the discrete Fourier transform (DFT), discrete-time Fourier transform (DTFT), Z-transform, circular convolution, linear convolution, and fast Fourier transform (FFT) algorithms. Specifically, it includes: - One mark questions testing basic understanding of properties, definitions and relationships between DFT, DTFT, Z-transform, circular and linear convolution. - Ten mark questions involving derivations, proofs of properties, computations of DFT/DTFT and use of FFT algorithms to efficiently compute DFT, as well as overlap-add and overlap-save methods for long sequence filtering.

    Copyright:

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

    EC431 Digital signal processing

    Unit-II

    One mark questions:

    1. Write the expression for DTFT for a signal x(n).


    2. The spectrum of DTFT is __________. [Continuous/Discrete]
    3. What is meant by zero-padding?
    4. What is the relation between Z-Transform and DFT?
    5. State time-shifting property of DFT.
    6. The Fourier transform of a signal is continuous & periodic, then the signal must be
    ________
    7. What is the relation between Z-Transform and DTFT?
    8. What is the DTFT of  (n) ?
    9. The spectrum of DFT is __________. [Continuous/Discrete]
    10. The 2-point DFT a discrete sequence x(n) = {5, 6} is ______________
    11. What is the relation between DTFT and DFT?
    12. If x(n) is a sequence of ‘L’ no. of samples and h(n) with ‘M’ samples after circular
    convolution y(n) will contain _______ no. of samples.
    13. State time-reversal property of DFT.
    14. State circular convolution property of DFT.
    15. State periodicity property of DFT.
    16. State parseval’s theorem for discrete signals in DTFT.
    17. What is the DFT of 𝛿(𝑛).
    18. Define circular convolution.
    19. If the DFT of x(n) = X(k), obtain the DFT of x(N-n).
    20. Write twiddle factor matrix for N=4.
    21. Write the N-point DFT of the sequence x(n) _____________
    22. Write the N-point IDFT of the sequence X(k) _____________
    23. State the properties of DFT.
    24. Compute the DFT of a sequence (-1)n for N=4.
    25. How to obtain the output sequence of linear convolution through circular convolution?
    26. What are the uses of zero padding?
    27. Differentiate between DTFT and DFT. Why it is advantageous to use DFT in
    computers rather than DTFT?
    28. Distinguish between linear and circular convolution of two sequences.
    29. Obtain the circular convolution of the following sequences x(n)= {1, 2, 1} and
    h(n)= {1, -2, 2}.
    30. Find the DFT of the sequence x(n)= {1, 1, 0, 0}
    31. How the circular convolution is obtained?
    Ten mark questions:

    1. a) State and prove the circular convolution property of DFT. [5 Marks]


    b) Find the circular convolution of x[n] = {2, 1, 2, -1} and h[n] = {1, 2, 3, 4} by using
    concentric circle method. [5 Marks]
    2. a) State and prove time shifting and time reversal properties of DTFT. [6 Marks]
    b) Find the 4-point DFT of the following sequence x(n)={1,2,3} [4 Marks]
    3. Determine the eight-point DFT of the signal
    𝑥(𝑛) = {1,1,1,1,1,1,0,0}
    and sketch its magnitude and phase. [10 Marks]
    4. a) Determine circular convolution of x(n)={1,2,3,1} and h(n)={1,1,1} using DFT.
    [6 Marks]
    b) State and prove periodicity property of DFT. [4 Marks]
    5. Find the DTFT of the sequence given below. Also draw the frequency response.

    x(n) =1 for n= -2,-1,0,1,2

    =0 otherwise [10 Marks]

    6. a) Find the linear convolution of x(n) = [1, 2,3] and h(n) = [3,2] using the DFT. [6 Marks]
    b) State and prove circular time shifting property of DFT. [4 Marks]

    UNIT-III

    One Marks questions:

    1. Determine the number of complex multiplications required in DIF-FFT algorithm for


    N=16.
    2. Determine the number of complex additions required in DIF-FFT algorithm for N=16.
    3. What is the speed improvement factor for 8-point FFT over 8-point DFT?
    4. Draw the basic butterfly diagram for DIT-FFT algorithm.
    5. Draw the basic butterfly diagram for 4-point DIF-FFT algorithm.
    6. Draw the basic butterfly diagram for DIF-FFT algorithm
    7. The number of complex multiplications and complex additions required to obtain 128
    point DFT using decimation-in-time radix-2 FFT _______________.
    8. What is Radix?
    9. What are the two methods used for sectional convolution.
    10. The twiddle factor exponents for 2nd stage in 16-point DIT-FFT are _______.
    11. What is the basic operation of DIT algorithm?
    12. What is the basic operation of DIF algorithm?
    13. How many multiplications are required to compute N-point DFT using Radix-2 FFT.
    14. How many additions are required to compute N-point DFT using Radix-2 FFT.
    15. What is the main advantage of FFT?
    16. What is the value of 𝑊41 ___________
    17. What is the order of the input sequence in radix-2 DIT-FFT algorithm?
    18. The number of stages required in the flow graph for N-point radix-2 DIT-FFT
    algorithm.
    19. What is the order of the output sequence in radix-2 DIF-FFT algorithm?
    20. The number of stages required in the flow graph for 8-point radix-2 DIT-FFT algorithm.
    21. What is the periodicity property of twiddle factor?
    22. What is meant by sectional convolution?
    23. Write briefly about overlap-save method.
    24. Write briefly about overlap-add method.
    25. Differences between DIT-FFT algorithm and DIF-FFT algorithm.
    26. Similarities between DIT-FFT algorithm and DIF-FFT algorithm.
    27. What is the symmetry property of Twiddle factor?
    28. What are the applications of FFT algorithms?
    29. Draw the 4-point Radix-2 DIT-FFT butterfly structure for DFT.
    30. The first six points of the 8-point DFT of a real valued sequence are 5, 1 −3j, 0, 3 – 4j,
    0 and 3 + 4j. The last two points of the DFT are __________
    31. What is the speed improvement factor in calculating 64-point DFT of a sequence using
    direct computation and FFT algorithms?

    Ten Marks questions:

    1. Derive the signal flow graph for the 8-point, radix-2 Decimation in frequency FFT
    algorithm.
    2. Derive decimation-in-time radix-2 FFT algorithm for determining DFT coefficients and
    draw signal flow graph for 8-point computation.
    3. Find the 8-point DFT of a sequence x(n)={1,2,3,4,4,3,2,1} using radix-2 DIT-FFT
    algorithm.
    4. Given X(k) = {28, -4+j9.656, -4+j4, -4+j1.656, -4, -4-j1.656, -4-j4, -4-j9.656}, find x(n)
    using inverse DIT FFT algorithm.
    5. Perform linear convolution of finite duration sequences h(n) = {1, 1, 1} and
    x(n)= {3, -1, 0, 1, 3, 2, 0, 1, 2, 1} by (a) overlap-add method (b) overlap-save method.
    6. Find the 8-point DFT of a sequence x(n)={1,2,3,4,4,3,2,1} using radix-2 DIF-FFT
    algorithm.
    7. Explain overlap-add and overlap-save methods for filtering the long sequences.

    You might also like