0% found this document useful (0 votes)
46 views1 page

Department of Electrical and Electronics Engineering: Home Work Problems On Zoom Session-3 Held On 26/03/2020

The document provides 3 homework problems on finding sequences and their transforms using the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT). Problem 1 asks students to use the inverse DFT to find x(n) given the sequence X(k). Problem 2 asks students to use the DFT to find the sequence x(n) given its DFT samples X(k). Problem 3 asks students to use the DFT to find the IDFT of the sequence X(k) given.

Uploaded by

Madangle Jungle
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
0% found this document useful (0 votes)
46 views1 page

Department of Electrical and Electronics Engineering: Home Work Problems On Zoom Session-3 Held On 26/03/2020

The document provides 3 homework problems on finding sequences and their transforms using the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT). Problem 1 asks students to use the inverse DFT to find x(n) given the sequence X(k). Problem 2 asks students to use the DFT to find the sequence x(n) given its DFT samples X(k). Problem 3 asks students to use the DFT to find the IDFT of the sequence X(k) given.

Uploaded by

Madangle Jungle
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

Department of Electrical and Electronics Engineering

Home Work Problems on Zoom Session-3 held on 26/03/2020

1. If X(k) {0, (1-j), 0, 0, 0, 0, 0, (1+j)} find x(n) using Inverse DIF FFT algorithm.

2. Find the 4 point real sequence x(n) if its 4 point DFT samples are X(0) = 6, X(1) = -2+j2,

X(2) = -2. Use DIF FFT algorithm.

3. Find the IDFT of the sequence X(k) given below:

X(k) = (1, 0, 0, j, 0, -j, 0, 0) using DIF FFT algorithm

You might also like