The computational procedure for Decimation in frequency algorithm take – McqOptions

MCQOPTIONS

1.	The computational procedure for Decimation in frequency algorithm takes
A.	Log2 N stages
B.	2Log2 N stages
C.	Log2 N
D.	Log2 N/2 stages
Answer» B. 2Log2 N stages

Discussion

No Comment Found

Related MCQs

The Nyquist theorem for sampling1) Relates the conditions in time domain and frequency domain2) Helps in quantization3) Limits the bandwidth requirement4) Gives the spectrum of the signal
FFT may be used to calculate1) DFT2) IDFT3) Direct Z transform4) In direct Z transform
Telegraph signals are examples of
As compared to the analog systems, the digital processing of signals allow1) Programmable operations2) Flexibility in the system design3) Cheaper systems4) More reliability
The Cooley Tukeyalgorithm of FFT is a
A discrete time signal may be1) Samples of a continuous signal2) A time series which is a domain of integers3) Time series of sequence of quantities4) Amplitude modulated wave
The transforming relations performed by DTFT are1) Linearity2) Modulation3) Shifting4) Convolution
The computational procedure for Decimation in frequency algorithm takes
The DFT is preferred for1) Its ability to determine the frequency component of the signal2) Removal of noise3) Filter design4) Quantization of signal
The transformations are required for1) Analysis in time or frequency domain2) Quantization 3) Easier operations4) Modulation