Scribd
Upload
26 views2 pages

Assignment 1

This document outlines the first assignment for a Digital Signal Processing course, due on February 28, 2024. It includes various tasks such as determining points of the DFT for a sequence, computing circular convolution, and analyzing causal LTI systems. Additionally, it covers Fourier transforms and DFT calculations for given sequences and signals.

Uploaded by

harishkumarat004
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
26 views2 pages

Assignment 1

This document outlines the first assignment for a Digital Signal Processing course, due on February 28, 2024. It includes various tasks such as determining points of the DFT for a sequence, computing circular convolution, and analyzing causal LTI systems. Additionally, it covers Fourier transforms and DFT calculations for given sequences and signals.

Uploaded by

harishkumarat004
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/ 2

19ECE211 Digital Signal Processing

Assignment #1
Due Date : February 28, 2024
1. The first five points of the eight-point DFT of a real-valued sequence are
(0.75, 0.5 − 𝑗 0.3018, 2, 0.5 − 𝑗0.0518, 2}. Determine the remaining three points.
2. Compute the eight-point circular convolution for the following sequences
3𝜋
𝑥1[𝑛] = (1,1,1,1,0,0,0,0} and 𝑥2(𝑛) = 𝑠𝑖𝑛 𝑛 0 ≤ 𝑛 ≤ 7
8

3. Given the 8 -point DFT of the sequence


1, 0 ≤ 𝑛 ≤ 4
𝑋[𝑛] = {
0, 5 ≤ 𝑛 ≤ 7
Compute the DFT of the sequences using properties,
1, 𝑛=0
𝑋1[𝑛] = {0, 1 ≤ 𝑛 ≤ 3
1, 4 ≤ 𝑛 ≤ 7
1, 𝑛=0
𝑋2[𝑛] = {2, 1 ≤ 𝑛 ≤ 3
0, 4 ≤ 𝑛 ≤ 7
4. Consider the sequences
𝑋1[𝑛] = {𝟏, 1, 2, 3 5} 𝑥2[𝑛] = {𝟐, 3, 4 , 4, 4} 𝑠[𝑛] = {𝟐, 1, 1, 1, 1}
And their 5- point DFTs.
(a) Determine a sequence y[n] so that 𝑌[𝑘] = 𝑋1[𝑘]𝑋2[𝑘]
(b) Is there a sequence x3[n] such that 𝑆[𝑘] = 𝑋1[𝑘]𝑋3[𝑘]?
5. Consider a causal LTI system with system function
1
H(z) = 1+ 0.2𝑧 −1

The output y[n] of the system is known for 0 ≤ 𝑛 ≤ 63. Assuming that H(z) is available,
can you develop a 64 -point DFT method to recover the sequence 𝑥[𝑛], 0 ≤ 𝑛 ≤ 63? Can
you recover all values of x[n] in this interval?
6. Consider the finite-duration signal 𝑥(𝑛) = {5,7,3,2}
a) Compute its four-point DFT by solving explicitly the 4-by-4 system of linear equations
defined by the inverse DFT formula.
(b) Check the answer in part (a) by computing the four-point DFT, using its definition.
7. (a) Determine the Fourier transform X (ꞷ) of the signal 𝑥[𝑛] = {2, 3, 𝟒, 5, 2}
(b) Compute the 6-point DFT V (k) of the signal 𝑣(𝑛) = {𝟐 ,3 ,2 ,0 ,3 ,2}
(c) Is there any relation between X(w) and V(k)? Explain.
1−𝑎2
8. The signal x[n] = 𝑎|𝑛| , -1 < a < 1 has a fourier transform X (ꞷ) = 1−2 𝑎 𝑐𝑜𝑠𝜔+𝑎2

a) Plot X (ꞷ) for 0 ≤ ꞷ ≤ 2𝜋, 𝑎 = 0.8


Reconstruct and plot X (ꞷ) from its samples 𝑋(2 𝜋𝑘 / 𝑁), 0 ≤ 𝑘 ≤ 𝑁 − 1. For 𝑁 = 20
and 𝑁 = 100
b) Illustrate the time – domain aliasing when 𝑁 = 20.

You might also like