Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

If X(k) is the N-point DFT of a sequence x(n), then circular time shift property is that N-point DFT of x((n-l))N is X(k)e-j2πkl/N.
If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)?
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 wise ii) Compute the M-point DFT of each row iii) 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.
The first five points of the 8-point DFT of a real valued sequence are 5, 1 - j3, 0, 3 - j4 and 3 + j4. The last two points of the DFT are respectively
{a(n)} is a real-valued periodic sequence with a period N. x(n) and X(k) form N-point Discrete Fourier Transform (DFT) pairs. The DFT Y(k) of the sequence
$$y\left( n \right) = \frac{1}{N}\sum\limits_{r = 0}^{N - 1} {x\left( r \right)} x\left( {n + r} \right)$$      is
Consider the following statements with respect to Discrete Fourier Transform (DFT): 1. It is obtained by performing a sampling operation in the time domain. 2. It transforms a finite duration sequence into a discrete frequency spectrum. 3. It is obtained by performing a sampling operation in both time and frequency domains. Which of the above statements is/are correct?
Overlap add and Overlap save are the two methods for linear FIR filtering a long sequence on a block-by-block basis using DFT.
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.
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 X(k) is the N/2 point DFT of the sequence x(n), then what is the value of X(k+N/2)?