Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

{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
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.
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
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.
For a Fibonacci sequence, from the third term onwards, each term in the sequence is the sum of the previous two terms in that sequence. If the difference in squares of 9th and 8th terms of this sequence is 1869, what is the 11th term of this sequence?
Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm?
P. A larger E-value indicates higher sequence similarity.
Q. E-value -10 indicates sequence homology.
R. A higher BLAST score indicates higher sequence similarity.
S. E-value > 10-10 indicates sequence homology.
If X(k) is the N/2 point DFT of the sequence x(n), then what is the value of X(k+N/2)?
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.
What is the total number of quantization errors in the computation of single point DFT of a sequence of length N?