How many complex additions are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM?
A. N(L+M+2)
B. N(L+M-2)
C. N(L+M-1)
D. N(L+M+1)
Answer:A
How many complex additions are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM?
A. N(L+M+2) B. N(L+M-2) C. N(L+M-1) D. N(L+M+1)