Scribd
Upload
66 views1 page

DSP Tutorial-1

This document provides a tutorial on digital signal processing for the 6th semester B.Tech course in electronics and communication engineering, including 5 questions on topics like the discrete Fourier transform, linear and circular convolution using various methods, and the fast Fourier transform with the inverse discrete Fourier transform using a butterfly structure. The questions are meant to reinforce concepts from Unit 1 of the subject with their corresponding course outcomes indicated.

Uploaded by

Karan Bhardwaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views1 page

DSP Tutorial-1

This document provides a tutorial on digital signal processing for the 6th semester B.Tech course in electronics and communication engineering, including 5 questions on topics like the discrete Fourier transform, linear and circular convolution using various methods, and the fast Fourier transform with the inverse discrete Fourier transform using a butterfly structure. The questions are meant to reinforce concepts from Unit 1 of the subject with their corresponding course outcomes indicated.

Uploaded by

Karan Bhardwaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Bhagwan Prashuram Institute of Technology

(Affiliated to Guru Gobind Singh Indraprastha University, Approved by


AICTE, New Delhi)

TUTORIAL 1 [Unit 1 ]
Course B.Tech(ECE) Semester 6th sem

Subject Code ETEC-306 Subject Name Digital Signal Processing

Max. Marks 20 Faculty Name Mr. Jatin Gaur

Last Date of Submission:28th April 2023


Questions CO
1 I. Perform N point DFT of the following sequence, (N=4) 1
A. x[n]= ,a<1
B. x[n]={-3 4 -2 6}
II. Evaluate the value of x[n] for given X[k]
X[k]= [1 2-5i -1 2+5i]

2 Perform linear and circular convolution of given sequences using Graphical approach 1
and matrix method.
x[n]= n+1 , 0  n  1
n-2 , 2  n  3 otherwise
y[n]={1 ,5 ,7 ,3}

Evaluate the circular convolution of given sequences using DFT and IDFT method. 1
3 1 3
x[n]=  2 (n  k )    (n  k )
k 0 k 2

y[n]= [-1 -3 2 -1]

Perform FFT-DIT of given sequence. 1


4 x[n]= n+1 , 0  n  7

5 Evaluate IDFT using Butterfly structure 1


X[k]= [20, -6.12 - 5.12i, 1+ 9i, -1.88 + 0.88i, 2, -1.88 - 0.88i, 1 - 9i, -6.12 +
5.12i]

You might also like