RAJ KUMAR GOEL INSTITUTE OF TECHNOLOGY FOR WOMEN,
GHAZIABAD
DIGITAL SIGNAL PROCESSING /NAVEEN DUBEY
ASSIGNMENT-2 DATE OF SUBMISSION- 25/03/2015
------------------------------------------------------------------------------------------------
1. Find the relation between the DFT of x[n] and the DFT of
x[n], the
complex conjugate sequence.
2. Draw the basic butterfly diagram for a single Radix-2
Decimation in
Time algorithm. In general compute the number of complex
multiplication and additions required.
3. You have written a code for computing N point DFT. How will
you
use the same code to compute the Inverse DFT.
4. Develop a radix-3 DIT algorithm for N= 3V and draw the
butterfly
diagram for N = 9. How many computations are required?
5. Show how to compute DFT of a sequence of length 24 , using
three 8
point DFTs.
7. Give solutions for question no. mention below Book: Exercise
(review questions): DSP, S Salivahan,A Vallavaraj & C
Gnanapriya , 2
nd Edition
6.46, 6.47,6.51,6.57,6.60,6.65, 6.66
8. Assume a 8 point sequence and calculate the DFT coefficients
using
basic method and verify your answer using FFT-DIT, FFT-DIF
