The total number of complex multiplications required to compute N point DFT by radix-2 FFT is?

The total number of complex multiplications required to compute N point DFT by radix-2 FFT is? Correct Answer (N/2)log2N

The decimation of the data sequence should be repeated again and again until the resulting sequences are reduced to one point sequences. For N=2v, this decimation can be performed v=log2N times. Thus the total number of complex multiplications is reduced to (N/2)log2N.

Related Questions

How far is point 'R' from Point 'T'? Statement (I): Point 'R' is 5 metres to the north of point 'M'. Point 'U' is 4 metres to the east of point 'R'. Point 'T' is to the west of point 'R' such that points 'U' 'R' and 'T' form a straight line of  metres. Statement (II): Point 'Z' is metres to the south of point 'T'. Point 'U' is  metres to the east of point 'T'. Point 'M' is  metres to the east of point 'Z'. Point 'R' is  metres to the north of point 'M'. Point 'R' lies on the line formed by joining points 'T' and 'U'.
The total number of complex additions required to compute N point DFT by radix-2 FFT is?