Which of the following is true regarding the number of computations r – McqOptions

MCQOPTIONS

1.	Which of the following is true regarding the number of computations required to compute an N-point DFT?
A.	N2 complex multiplications and N(N-1) complex additions
B.	N2 complex additions and N(N-1) complex multiplications
C.	N2 complex multiplications and N(N+1) complex additions
D.	N2 complex additions and N(N+1) complex multiplications
Answer» B. N2 complex additions and N(N-1) complex multiplications

Discussion

No Comment Found

Related MCQs

If we store the signal row wise and compute the L point DFT at each column, the resulting array must be multiplied by which of the following factors?
If we store the signal row wise then the result must be read column wise.
Which is the correct order of the following steps to be done in one of the algorithm of divide and conquer method?i) Store the signal column wiseii) Compute the M-point DFT of each rowiii) Multiply the resulting array by the phase factors WNlq.iv) Compute the L-point DFT of each column.v) Read the result array row wise.
How many complex additions are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM?
How many complex multiplications are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM?
If N=LM, then what is the value of WNmqL?
If the arrangement is of the form in which the first row consists of the first M elements of x(n), the second row consists of the next M elements of x(n), and so on, then which of the following mapping represents the above arrangement?
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.
The computation of XR(k) for a complex valued x(n) of N points requires _____________
What is the real part of the N point DFT XR(k) of a complex valued sequence x(n)?