Episode -1 Learn complete DFT FFT in 2.5 hours _ DPP-19

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

1

Branch: EC/EE Batch : Crash Course


Subject : Signal and System DPP-19

Topic: DFT & FFT


1. Discrete Fourier transform of a real sequence is 5. The first six points of the 8-point DFT of a real-valued
sequence are 5, 1 –j3, 0, 3, –j4, 0 and 3 – j4. The last
XDFT[k] = {1, 2, a, b, 0, 1 – j, –2, c}
two points of the DFT are respectively.
The values of a is_______.
(a) 0, 1 – j3 (c) l + j3, 5
(b) 1 + 3j, 5 (d) 1–j3, 5
2. The 4-point Discrete Fourier Transform (DFT) of a
6. The DFT of a vector [a b c d] is the vector [α β γ δ].
discrete time sequence {1,0,2,3} is
Consider the product:
(a) [0,–2 + 2j, 2, –2 – 2j]
a b d
c
(b) [2, 2 + 2j, 6, 2 – 2j] d a c 
b
(c) [6, l – 3j, 2, 1 + 3j) [ p q r s ]  [a b c d ] 
c
d a b
(f) [6, –1 + 3j, 0, –1 – 3j]  
b
c d b
3. 4-point DFT of a real discrete-time signal x[n] of The DFT of the vector [p q r s] is a scaled version of
length 4 is given by X[k], n = 0,l,2,3 and k = 0,1,2,3. (a) [2 2  2 2 ]
It is given that X[0] = 5, X[l] = l + jl, X[2] = 0.5.
X[3] and X[0] respectively are (b) [     ]
(a) 1 – j, 1.875 (b) l – j, 1.500 (c) [           ]
(c) 1 + j, 1.875 (d) 0.1 – j, 1.500
(d) [   ]

4. For air N-point FFT algorithm with N = 2m, which


one of the following statements is true? 7. FFT can be used for the computation of
(a) It is not possible to construct a signal flow graph (a) linear convolution but not circular convolution
with both input and output in normal order. (b) circular convolution but not linear convolution
(b) The number of butterflies in the mth state is N/m. (c) both linear and circular convolutions
(c) In-place computation requires the storage of only (d) neither linear not circular convolutions
2 N node data.
(d) Computation of a butterfly requires only one 8. The number of complex multiplications needed to be
complex multiplication. performed for computation of an N-point DFT
directly, is
(a) (N – 1) (b) N2
(c) (N – 1)2 (d) 2N

9. How many adders are required to realize a 256 point


radix-2 FFT using DIT?
(a) 256 (b) 1024
(c) 4096 (d) 2048
2

Answer Key

1. -2 6. (a)
2. (d) 7. (b)
3. (a) 8. (c)
4. (d) 9. (d)
5. (b)

For more questions, kindly visit the library section: Link for app: https://physicswallah.live/tabs/tabs/library-tab
For more questions, kindly visit the library section: Link for web: https://links.physicswallah.live/vyJw
Any issue with DPP, please report by clicking here- https://forms.gle/t2SzQVvQcs638c4r5

PW Mobile APP: https://play.google.com/store/apps/details?id=xyz.penpencil.physicswala


For PW Website: https://www.physicswallah.live/contact-us

You might also like