For an N-point FFT algorithm with N = 2m which one...

Home / Electronics And Communications Engineering / Signal Processing / Question

Examveda

For an N-point FFT algorithm with N = 2^m, which one of the following statements is TRUE?

A. It is not possible to construct a signal flow graph with both input and output in normal order

B. The number of butterflies in the mn state is $$\frac{N}{m}$$

C. In-place computation requires storage of only 2N node data

D. Computation of a butterfly requires only one complex multiplication

Answer: Option D

Related Questions on Signal Processing

A. Odd symmetry

B. Even symmetry

C. Conjugate symmetry

D. No symmetry

View Answer

A. $$V$$

B. $${{{T_1} - {T_2}} \over T}V$$

C. $${V \over {\sqrt 2 }}$$

D. $${{{T_1}} \over {{T_2}}}V$$

View Answer

A. $$T = \sqrt 2 {T_s}$$

B. T = 1.2T_s

C. Always

D. Never

View Answer

A. $${{\alpha - \beta } \over {\alpha + \beta }}$$

B. $${{\alpha \beta } \over {\alpha + \beta }}$$

C. α

D. β

View Answer