ExamVeda
Login
Home
Signal Processing
?

The N-point DFT of a sequence x[n], 0 ≤ n ≤ N - 1 is given by
$$X\left[ K \right] = \frac{1}{{\sqrt N }}\sum\limits_{n = 0}^{N - 1} {x\left[ n \right]} {e^{ - j\frac{{2\pi }}{N}nK}},0 \leqslant K \leqslant N - 1$$
Denote this relation as X = DFT(x). For N = 4, which one of the following sequences satisfies DFT (DFT (x)) = x.

Answer & Solution
Correct Answer: Option B
Let's discuss the solution. Join the discussion
Examveda
Question posted by Examveda
Community

Join the Discussion

No comments yet Be the first to discuss this question.