Scribd
Upload
181 views6 pages

Objective questions-IAT-1

The document contains questions about digital signal processing and fast Fourier transforms (FFTs). It asks about properties of the discrete Fourier transform (DFT) and FFT algorithms like decimation-in-time and decimation-in-frequency. Questions cover topics like twiddle factors, butterfly diagrams, complexity of the DFT and applications of DSP like noise elimination and music/image processing.

Uploaded by

SETNHIL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
181 views6 pages

Objective questions-IAT-1

The document contains questions about digital signal processing and fast Fourier transforms (FFTs). It asks about properties of the discrete Fourier transform (DFT) and FFT algorithms like decimation-in-time and decimation-in-frequency. Questions cover topics like twiddle factors, butterfly diagrams, complexity of the DFT and applications of DSP like noise elimination and music/image processing.

Uploaded by

SETNHIL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

1. For the calculation of N- point DFT, Radix -2 FFT algorithm repeats.

a. 2(N Log2 N) stages


b. (N Log2 N)2/2 stages
c. (N Log2 N)/2 stages
d. (N Log2(2 N))/2 stages

2. State the properties of DFT.

a. Periodicity & Time reversal


b. Linear or Nonlinear
c. Complex conjugate & Time reversal
d. None of the above

3. Compute the DFT of the sequence (𝑛) = {1,−1,1,−1}.

a) {0,0,0,4}
b) {4,0,0,0}
c) {0,0,4,0}
d) {4,0,4,0}

4. Demonstrate the output y(n) of a filter whose impulse response ℎ(𝑛) = {1,1,1} and
input signal 𝑥(𝑛) = {3,−1,0,1,3,2,0,1,2,1} using overlap save method

a) {*,*,2,2,0,4,6,5,3,3,4,3}
b) {*,*,2,0,4,6,5,3,3,4,3,1}
c) {*,2,2,0,4,0,5,3,3,4,3,1}
d) {*,2,2,0,4,6,5,3,3,4,3,1}

5. Analyze the inverse DFT of Y(𝐾) = {1,2,3,4}

a) {10, -2+2j, -2, -2-2j}


b) {10, -2-2j, -2, -2+2j }
c) {10, -2-2j, -2, -2-2j }
d) {10, -2+2j, -2, -2+2j }

6. Find the 8-point of a given sequence x(𝑛) = {0,1,2,3,4,5,6,7} using DIF-FFT algorithm

a) {28, -4-j9.656, -4+4j, -4+j1.656, -4, -4-j1.656, -4-4j, -4+j9.656 }


b) {28, -4+j9.656, -4+4j, -4-j1.656, -4, -4+j1.656, -4-4j, -4-j9.656 }
c) {28, -4+j9.656, -4-4j, -4+j1.656, -4, -4-j1.656, -4+4j, -4-j9.656 }
d) {28, -4+j9.656, -4+4j, -4+j1.656, -4, -4-j1.656, -4-4j, -4-j9.656 }
7. Evaluate the 8 point for the given sequence using DIT FFT algorithm
x(𝑛) = {1 𝑓𝑜𝑟 −3≤𝑛≤3
1 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
a) {8,0,0,0,4,0,0,0}
b) {8,0,0,0,0,0,0,0}
c) {4,0,0,0,8,0,0,0}
d) {0,0,0,0,4,0,0,0}

8. Compute the DFT of the sequence x(𝑛) = 𝑐𝑜𝑠 (𝑛𝜋/2) where 𝑁 = 4 using DIF FFT algorithm.
a) {0,0,0,4}
b) {2,0,0,0}
c) {2,0,2,0}
d) {4,0,4,0}

9. What are the twiddle factor of FFT algorithm?

a) {  = 1,  = 0.707-0.707j,  = -j,  = -0.707-0.707j}


b) {  = 1,  = -j,  = 0.707-0.707j,  = -0.707-0.707j}
c) {  = 1,  = 0.707-0.707j,  = j0.707-0.707j,  = -0.707-0.707j}
d) {  = 0.707-0.707j,  = 0.707-0.707j,  = -j,  = -0.707-0.707j}

10. How many complex multiplications are required to compute X(k)?

a) N(N+1)
b) N(N-1)/2
c) N2/2
d) N(N+1)/2

11. The following butterfly diagram is used in the computation of __________

a) Decimation-in-time FFT
b) Decimation-in-frequency FFT
c) All of the mentioned
d) None of the mentioned
12. For a decimation-in-time FFT algorithm, which of the following is true?

a) Both input and output are in order


b) Both input and output are shuffled
c) Input is shuffled and output is in order
d) Input is in order and output is shuffled

13. The following butterfly diagram is used in the computation of __________

a) Decimation-in-time FFT
b) Decimation-in-frequency FFT
c) All of the mentioned
d) None of the mentioned

13. For a decimation-in-frequency FFT algorithm, which of the following is true?

a) Both input and output are in order


b) Both input and output are shuffled
c) Input is shuffled and output is in order
d) Input is in order and output is shuffled

14. The DFT is preferred for


1) Its ability to determine the frequency component of the signal
2) Removal of noise
3) Filter design
4) Quantization of signal

a. 1, 2 and 3 are correct


b. 1 and 2 are correct
c. 1 and 3 are correct
d. All the four are correct

15. FFT may be used to calculate.

1) DFT
2) IDFT
3) Direct Z transform
4) In direct Z transform

a. 1, 2 and 3 are correct


b. 1 and 2 are correct
c. 1 and 3 are correct
d. All the four are correct

16.
16. Which is a typical application of digital signal processing?
A
Noise elimination
.
B. Music signal processing
C. Image processing
D
All of the above
.
17.
17. What do we call the manipulation of an analog signal in a digital domain?
A
Analog-to-digital conversion
.
B. Digital-to-analog conversion
C. Digital signal processing
D
Signal filtering
.

18. If we split the N point data sequence into two N/2 point data sequences f 1(n) and f2(n)
corresponding to the even numbered and odd numbered samples of x(n), then such an
FFT algorithm is known as decimation-in-time algorithm.

a) True
b) False
19. If we split the N point data sequence into two N/2 point data sequences f 1(n) and f2(n)
corresponding to the even numbered and odd numbered samples of x(n) and F1(k) and
F2(k) are the N/2 point DFTs of f1(k) and f2(k) respectively, then what is the N/2 point
DFT X(k) of x(n)?

a) F1(k)+F2(k)
b) F1(k)-WNk F2(k)
c) F1(k)+WNk F2(k)
d) None of the mentioned
20. Divide-and-conquer approach is based on the decomposition of an N-point DFT into
successively smaller DFTs. This basic approach leads to FFT algorithms.
a) True
b) False
21. What is the circular convolution of the sequences X1(n)={2,1,2,1} and
x2(n)={1,2,3,4}?

a) {14,14,16,16}
b) {16,16,14,14}
c) {2,3,6,4}
d) {14,16,14,16}
22. What is the circular convolution of the sequences X1(n)={2,1,2,1} and
x2(n)={1,2,3,4}, find using the DFT and IDFT concepts?

a) {16,16,14,14}
b) {14,16,14,16}
c) {14,14,16,16}
d) None of the mentioned
23. If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?

a) X(N-k)
b) X*(k)
c) X*(N-k)
d) None of the mentioned
24. Demonstrate the output y(n) of a filter whose impulse response ℎ(𝑛) = {1,-1} and
input signal 𝑥(𝑛) = {1,1,2,2,3,3,4,4} using overlap add method.

a) {1,0,1,0,1,0,1,0,-4}
b) {*,0,1,0,1,0,1,0,-1}
c) {4,0,1,0,1,0,1,0,-4}
d) {*,0,1,0,1,0,1,0,-4}
25. Find the 8-point of a given sequence x(𝑛) = {0,1,2,3,4,5,6,7} using Decimation-in-
time -FFT algorithm

a) {28, -4-j9.656, -4+4j, -4+j1.656, -4, -4-j1.656, -4-4j, -4+j9.656 }


b) {28, -4+j9.656, -4+4j, -4-j1.656, -4, -4+j1.656, -4-4j, -4-j9.656 }
c) {28, -4+j9.656, -4-4j, -4+j1.656, -4, -4-j1.656, -4+4j, -4-j9.656 }
d) {28, -4+j9.656, -4+4j, -4+j1.656, -4, -4-j1.656, -4-4j, -4-j9.656 }

https://forms.gle/EFGvMCmQuRMnepnq9

You might also like