Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    DTSP Upload

    Uploaded by

    Uma Murugesan
    This document outlines the course content and assessment for the Discrete Time Signal Processing course. It includes course outcomes, sample exam questions covering various topics like DFT, convolution, adaptive filters and DSP architectures. Students are evaluated based on their performance in short answer questions, numerical problems and designing algorithms using techniques like DFT, FFT.

    Copyright:

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

    DTSP Upload

    Uploaded by

    Uma Murugesan
    5 views2 pages
    This document outlines the course content and assessment for the Discrete Time Signal Processing course. It includes course outcomes, sample exam questions covering various topics like DFT, convolution, adaptive filters and DSP architectures. Students are evaluated based on their performance in short answer questions, numerical problems and designing algorithms using techniques like DFT, FFT.

    Original Description:

    continuous assessment question paper

    Original Title

    dtsp upload

    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 outlines the course content and assessment for the Discrete Time Signal Processing course. It includes course outcomes, sample exam questions covering various topics like DFT, convolution, adaptive filters and DSP architectures. Students are evaluated based on their performance in short answer questions, numerical problems and designing algorithms using techniques like DFT, FFT.

    Copyright:

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

    DTSP Upload

    Uploaded by

    Uma Murugesan
    This document outlines the course content and assessment for the Discrete Time Signal Processing course. It includes course outcomes, sample exam questions covering various topics like DFT, convolution, adaptive filters and DSP architectures. Students are evaluated based on their performance in short answer questions, numerical problems and designing algorithms using techniques like DFT, FFT.

    Copyright:

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

    DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

    ACADEMIC YEAR 2022-2023 – ODD SEMESTER


    CONTINUOUS INTERNAL ASSESSMENT - I
    Course Code &Title:EC 8553 DISCRETE TIME SIGNAL PROCESSING
    Year / Semester :III/V Date : /09 2022
    Time : 3 hours Max Marks : 100 Marks

    CO1 To learn discrete fourier transform, properties of DFT and its application to linear filtering

    CO5 To introduce the concepts of adaptive filters and its application to communication
    engineering

    Answer all questions (*AUQ – Anna univ. questions)


    PART – A (10 X 2 =20 Marks)

    1.  Find the circular convolution for the given sequence x1(n)= {1,2,5,6} CO1 / U(Nov/Dec
    and h(n) = {1,0,-1,-2} 2021)

    2. The number of points is given by N = 64. Compute the number of CO1 / U(Nov/Dec
    complex multiplications and additions required to perform DFT and 2020)AUQ)
    FFT

    3. What are differences between overlap-save and overlap-add methods. CO1 / R

    4. Compare Energy and Power signals. CO1 / U

    5. List the differences between DFT and DTFT CO1 / R

    6. What is the need for pipelining in digital signal processors? CO5 /R(Nov/Dec
    2021)

    7. What is the difference between Harvard and Von Newman CO5 / R(Nov/Dec
    architecture. 2020)

    8. List the applications of DSP processors in Medical field CO5 / R

    9. Draw the Linear and circular addressing modes. CO5 / U

    10. Compare and contrast the fixed point and floating point processor CO5 / U
    PART – B (5 X 13 =65 Marks)
    11.a. Compute 8-point DFT of a sequence CO1/AP(Nov/
    x(n) ={1,3,6,8,-3,-7,-9,1}. Use DIT-FFT algorithm. Also compare DIT- Dec 2021)
    FFT and DIF Algorithms.
    (Or)
    11.b. Using linear convolution construct 𝑦(𝑛) = 𝑥(𝑛) ∗ ℎ(𝑛) for the sequence CO1/EV(Nov/
    𝑥(𝑛) = {1,2, −1,2,3, −2, −3, −1,1,1,2, −1}   and ℎ(𝑛) = Dec 2021)
    {1,2}. Compare the result by solving the problem using Overlap add
    method & Overlap save method.

    12.a. Construct the circular convolution of two finite duration sequences CO1 /AP
    x1(n) ={1,-1,-2,3,-1}: x2(n) = {1,2,3}
    (Or)

    12.b. Summarize the following properties of DFT: Periodicity, Linearity CO1 / R


    Circular frequency shifting & Multiplication.
    13.a With neat function block diagram, elaborate in detail about any one of CO5/U(Nov/Dec
    the latest DSP architectures. 2021)
    (Or)

    13.b Explain how programming is done in digital signal processors. Also CO5/U(Nov/Dec
    explain any one application. 2021)
    14.a CO5 / R
    Discuss in detail about the special addressing modes of digital signal
    processor
    (Or)

    14.b With neat sketch explain the architecture of TMS320C54x processor CO5 / U

    15.a CO5 / R
    Describe the principle of operation of floating point architecture with
    necessary diagram
    (Or)

    15.b i) Specify the role of accumulator in DS processor (5) CO5 / R


    ii) List out all the applications in Audio, telecommunication , medical
    and military fields (8)

    PART – C (1 X 15 =15 Marks)


    16.a. Given x(n) = 2 and N =8, find X(K) using DIT FFT algorithm.
    n
    CO1 / R

    (Or)

    16.b. Estimate the DFT for the sequence {1,2,3,4,4,3,2,1} using Radix-2 CO1 / U
    Decimation in Frequency algorithm.

    Prepared By

    You might also like