Scribd
Upload
11 views3 pages

Assignment 6 Questions

Uploaded by

mrinali.bheemani9
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
11 views3 pages

Assignment 6 Questions

Uploaded by

mrinali.bheemani9
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/ 3

Digital Signal Processing

(EC31201)
Assignment 6

1. Consider a six-point decimation in time FFT algorithm for which the signal flow graph
𝑗2𝜋
corresponding to 𝑋(1) is shown In the figure. Let 𝑊6 = exp (− 6
). In the figure, what should
be the values of the coefficients 𝑎1 , 𝑎2 , 𝑎3 in terms of 𝑊6 so that 𝑋(1) is obtained.

2. Realize the given filter using cascaded structure


3 1
(1 + 4 𝑧 −1 + 8 𝑧 −2 )
𝐻(𝑧) =
5 1 −2
1 − 𝑧 −1 + 𝑧
8 16

3. Realize a direct form FIR filter for the following impulse response.

4. Compute the 8-point DFT of the sequence (using DIT algorithm).


𝑥(𝑛) = 1, 0 ≤ 𝑛 ≤ 7
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
5. Compute the eight-point DFT of the above sequence by using the decimation-in-frequency
FFT algorithm as described in your class.

6. Compute the DFT of a sequence 𝑥(𝑛) = {1, −1, 1, −1} using DIT algorithm.

𝑛𝜋
7. Consider a discrete time periodic signal 𝑥[𝑛] = 𝑠𝑖𝑛( 5 ). Let 𝑎𝑘 be the complex Fourier series
coefficients of x[𝑛]. The coefficients {𝑎𝑘 } are non-zero when 𝑘 = 𝐷𝑚 ± 1, where m is any
integer. Find the value of D.

8. Consider a real periodic signal as shown in Figure below. Comment whether the following
statements are true or not (without explicitly evaluating Fourier series).
9. Consider finite length sequence x(n) in the given figure. The five point DFT of x(n) is
denoted by X(k). Plot the sequence whose DFT is Y(k) = e-4πk/5 X(k)

10. Consider the input signal x[n] = 6[n]+5[n-1]+4[n-2]+3[n-3]+2[n-4]+ [n-5]. The


system function is h[n] = [n]+[n-1]+[n-2].
a. Compute the circular convolution of x[n] and [n] with the help of frequency
domain multiplication.
b. How many samples in the circular convolution are corrupted if we desire the
linear convolution output?

_______________________________________________________________

You might also like