This set of Digital Signal Processing Multiple Choice Questions & Answers (MCQs) focuses on “Applications of FFT Algorithms”.

1. FFT algorithm is designed to perform complex operations.

a) True

b) False

View Answer

Explanation: The FFT algorithm is designed to perform complex multiplications and additions, even though the input data may be real valued. The basic reason for this is that the phase factors are complex and hence, after the first stage of the algorithm, all variables are basically complex valued.

2. If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the value of x1(n)?

View Answer

Explanation: Given x(n)=x1(n)+jx2(n)

=>x*(n)= x1(n)-jx2(n)

Upon adding the above two equations, we get x1(n)= (x(n)+x*(n))/2.

3. If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the value of x2(n)?

a) (x(n)-x*(n))/2

b) (x(n)+x*(n))/2

c) (x(n)+x*(n))/2j

d) (x(n)-x*(n))/2j

View Answer

Explanation: Given x(n)=x1(n)+jx2(n)

=>x*(n)= x1(n)-jx2(n)

Upon subtracting the above two equations, we get x2(n)= (x(n)-x*(n))/2j.

4. If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?

a) 1/2 [X*(k)+X*(N-k)].

b) 1/2 [X*(k)-X*(N-k)].

c) 1/2j [X*(k)-X*(N-k)].

d) 1/2j [X*(k)+X*(N-k)].

View Answer

Explanation: We know that if x(n)=x1(n)+jx2(n) then x1(n)= (x(n)+x*(n))/2

On applying DFT on both sides of the above equation, we get

X1(k)= 1/2 {DFT[x(n)]+DFT[x*(n)]}

We know that if X(k) is the DFT of x(n), the DFT[x*(n)]=X*(N-k)

=>X1(k)= 1/2 [X*(k)+X*(N-k)].

5. If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?

a) (1/2) [X*(k)+X*(N-k)].

b) (1/2) [X*(k)-X*(N-k)].

c) (1/2j) [X*(k)-X*(N-k)].

d) (1/2j) [X*(k)+X*(N-k)].

View Answer

Explanation: We know that if x(n)=x1(n)+jx2(n) then x2(n)= (x(n)-x^* (n))/2j.

On applying DFT on both sides of the above equation, we get

X2(k)= (1/2j) {DFT[x(n)]-DFT[x*(n)]}

We know that if X(k) is the DFT of x(n), the DFT[x*(n)]=X*(N-k)

=>X2(k)= (1/2j) [X*(k)-X*(N-k)].

6. If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=0,1,2…N-1?

a) X1(k)-W_{2}^{k}NX2(k)

b) X1(k)+W_{2}^{k}NX2(k)

c) X1(k)+W_{2}^{k}X2(k)

d) X1(k)-W_{2}^{k}X2(k)

View Answer

Explanation: Given g(n) is a real valued 2N point sequence. The 2N point sequence is divided into two N point sequences x1(n) and x2(n)

Let x(n)= x1(n)+jx2(n)

=> X1(k)= 1/2 [X*(k)+X*(N-k)] and X2(k)= 1/2j [X*(k)-X*(N-k)] We know that g(n)= x1(n)+x2(n)

=>G(k)= X1(k)+W

_{2}

^{k}NX2(k), k=0,1,2…N-1.

7. If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=N,N-1,…2N-1?

a) X1(k)-W_{2}^{k}X2(k)

b) X1(k)+W_{2}^{k}NX2(k)

c) X1(k)+W_{2}^{k}X2(k)

d) X1(k)-W_{2}^{k}NX2(k)

View Answer

Explanation: Given g(n) is a real valued 2N point sequence. The 2N point sequence is divided into two N point sequences x1(n) and x2(n)

Let x(n)= x1(n)+jx2(n)

=> X1(k)= 1/2 [X*(k)+X*(N-k)] and X2(k)= 1/2j [X*(k)-X*(N-k)] We know that g(n)= x1(n)+x2(n)

=>G(k)= X1(k)-W

_{2}

^{k}NX2(k), k= N,N-1,…2N-1.

8. Decimation-in frequency FFT algorithm is used to compute H(k).

a) True

b) False

View Answer

Explanation: The N-point DFT of h(n), which is padded by L-1 zeros, is denoted as H(k). This computation is performed once via the FFT and resulting N complex numbers are stored. To be specific we assume that the decimation-in frequency FFT algorithm is used to compute H(k). This yields H(k) in the bit-reversed order, which is the way it is stored in the memory.

9. How many complex multiplications are need to be performed for each FFT algorithm?

a) (N/2)logN

b) Nlog_{2}N

c) (N/2)log_{2}N

d) None of the mentioned

View Answer

Explanation: The decimation of the data sequence should be repeated again and again until the resulting sequences are reduced to one point sequences. For N=2

^{v}, this decimation can be performed v=log

_{2}N times. Thus the total number of complex multiplications is reduced to (N/2)log

_{2}N.

10. How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?

a) (N/2)logN

b) 2Nlog_{2}N

c) (N/2)log_{2}N

d) Nlog_{2}N

View Answer

Explanation: The number of additions to be performed in FFT are Nlog

_{2}N. But in linear filtering of a sequence, we calculate DFT which requires Nlog

_{2}N complex additions and IDFT requires Nlog

_{2}N complex additions. So, the total number of complex additions to be performed in linear filtering of a sequence using FFT algorithm is 2Nlog

_{2}N.

11. How many complex multiplication are required per output data point?

a) [(N/2)logN]/L

b) [Nlog_{2}2N]/L

c) [(N/2)log_{2}N]/L

d) None of the mentioned

View Answer

Explanation: In the overlap add method, the N-point data block consists of L new data points and additional M-1 zeros and the number of complex multiplications required in FFT algorithm are (N/2)log

_{2}N. So, the number of complex multiplications per output data point is [Nlog

_{2}2N]/L.

**Sanfoundry Global Education & Learning Series – Digital Signal Processing.**

To practice all areas of Digital Signal Processing, __here is complete set of 1000+ Multiple Choice Questions and Answers__.