engineering recuitment GATE ECE 2023-24 Test Series Signals and Systems Discrete Fourier Transform (DFT) and Discrete Fourier Series (DFS) Definition of Discrete Fourier Transform (DFT)
Given x[n] = {1, -1, 2, 3}
n starts from -1.
Find DFT{DFT[x(n)]} & choose the correct option/options from given choice.
DFT [x(n)] = X[K] = \(\rm \displaystyle\sum^{N-1}_{n=0}x[n].e^{-j\frac{2\pi}{N}k.n}\)
1
DFT {DFT [x(1)]} = 4
2
DFT {DFT [x(2)]} = 12
3
DFT {DFT [x(-1)]} = 8
4
DFT {DFT [x(0)]} = -4