Scribd
Upload
23 views

Digital Signal Processing: Assignment No. 4

1) Explain the Radix-3 DIT and DIF FFT algorithms for computing a sequence of length 9. 2) Derive an expression for the M-point DFT of a repeated length N signal in terms of the N-point DFT of the original length N signal. 3) Derive the decimation-in-time FFT algorithm for a 12-point DFT, drawing the complete flow diagram and comparing the complex operations to a direct 12-point DFT. 4) Show how to use a radix-2 FFT subroutine to efficiently compute a 768-point DFT, drawing a block diagram showing the radix-2 FFT as a black box.

Uploaded by

Aman Mathur
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
23 views

Digital Signal Processing: Assignment No. 4

1) Explain the Radix-3 DIT and DIF FFT algorithms for computing a sequence of length 9. 2) Derive an expression for the M-point DFT of a repeated length N signal in terms of the N-point DFT of the original length N signal. 3) Derive the decimation-in-time FFT algorithm for a 12-point DFT, drawing the complete flow diagram and comparing the complex operations to a direct 12-point DFT. 4) Show how to use a radix-2 FFT subroutine to efficiently compute a 768-point DFT, drawing a block diagram showing the radix-2 FFT as a black box.

Uploaded by

Aman Mathur
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

Digital Signal Processing: Assignment No.

1. We have discussed Radix-2 DIT and DIF FFT algorithms in the class. Explain Radix-3 DIT
and DIF FFT algorithm to evaluate sequence x[n] of length 9.
2. Consider the length N signal x[n] 6= 0, only for n = 0, 1, ....., N 1. Let y[n] be a new length
M = LN signal defined by repeating x[n] L times for some integer L: y[n] = x[nmodN ],
n = 0, 1, ...., LN 1.Find a simple expression for the M point DFT Y [k], k = 0, 1, .....M 1
of the signal y[n] in terms of the N point DFT X[l], l = 0, 1, .....N 1, of the signal x[n].
3. Derive Decimation in time FFT algorithm for a 12-point DFT, and draw a complete flow
diagram for the algorithm. Calculate the approximate number of complex operations required
to compute the 12-point FFT and compare with the number of complex expressions required
to compute the 12-point DFT directly.
4. We want to exactly compute an exact 768 point DFT. We have a radix-2 FFT subroutine
that computes DFT for N = 2M points for any integer value M .
(a) Show how to use this subroutine to efficiently compute a 768-point DFT.
(b) Draw a block diagram for your algorithm, showing the radix-2 FFT subroutine as a
black box with no detail regarding what is inside it.

You might also like