Scribd
Upload
61 views1 page

Subject: Digital Signal Processing (TE321) Practice Problem 2

This document contains 5 practice problems related to digital signal processing. The problems cover topics like calculating circular convolution using the convolution theorem, computing the discrete Fourier transform using direct, decimation-in-time, and decimation-in-frequency methods, obtaining the discrete Fourier transform of a sampled signal using the fast Fourier transform, finding the 8-point discrete Fourier transform of a sequence through propagation of additions and subtractions at each stage, and determining the radix-2 fast Fourier transform using butterfly operations and calculating speed improvement factors.

Uploaded by

russ90
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
61 views1 page

Subject: Digital Signal Processing (TE321) Practice Problem 2

This document contains 5 practice problems related to digital signal processing. The problems cover topics like calculating circular convolution using the convolution theorem, computing the discrete Fourier transform using direct, decimation-in-time, and decimation-in-frequency methods, obtaining the discrete Fourier transform of a sampled signal using the fast Fourier transform, finding the 8-point discrete Fourier transform of a sequence through propagation of additions and subtractions at each stage, and determining the radix-2 fast Fourier transform using butterfly operations and calculating speed improvement factors.

Uploaded by

russ90
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

Subject: Digital Signal Processing (TE321)

Practice Problem 2
Q1. Use the convolution theorem to calculate the circular convolution of the data
sequence {1, 1, 0, 1} & {1, 0, 0, 1}.

Q2. Calculate the DFT of the data sequence {0, 1, 1, 0} by using direct DFT
method & also using by DIT & DIF methods. Compare the number of complex
multiplications & additions in all three methods.

Q3. The first four sampled voltage values of a 10Hz bandwidth signal sampled at
125Hz were {0.5, 1, 1, 0.5} . Demonstrate how the DFT of this sequence may be
obtained using FFT.

Q4. Find the 8-point DFT of the following sequence characterized by the values:
x(1) = −1 , x(3) = 2 , x(5) = −6 , x(7 ) = 4
Considering;
- First block of N/4-point DFT produced 3 by addition & -7 by subtraction
- Second block of N/4-point DFT produced 8 by addition & 4 by subtraction
Obtain the values at each stage & propagate the diagram to the final stage.

Q5. Determine the Radix-2, 8-point FFT by butterfly method with the following data:
- First block of N/4 produces -5 by subtraction
- Second block of N/4 produces 8 by addition
- Third block of N/4 produces 7 by addition
- Fourth block of N/4 produces 9 by subtraction
- Bit reversed DIT sequence numbers are same i.e., 2
Show all calculations & find the weighted parameters. Furthermore if the speed
improvement factor (SIF) of all the four N/4 block accumulates to 16, then show
that the SIF will become half, if calculated for the following two N/2 blocks.

You might also like