Assume FFT of $x[n]$ is $X(k)$ and I would like to find $X(-k)$. I have implemented two techniques:
- I am calculating the
X(k) = fftshift(fft(x))
and then findX(-k)
to befliplr(X(k))
; - I write the
for
loop to correspond each symbol of in $X(k)$ to $X(N-K+1)$ where $N$ is the number of points used for FFT.
I get kind of similar answer but in the second approach I am mapping $X(N)$ to $X(1)$ which is DC, which should not be the case. Therefore I am suspecting I am doing something wrong.
Can anyone tell me what is the correct way to implement $X(-k)$ when you have the $X(k)$ ?