Discrete Fourier transform of a real sequence.
The returned real arrays contains:
[y(0),Re(y(1)),Im(y(1)),...,Re(y(n/2))] if n is even
[y(0),Re(y(1)),Im(y(1)),...,Re(y(n/2)),Im(y(n/2))] if n is odd
where
y(j) = sum[k=0..n-1] x[k] * exp(-sqrt(-1)*j*k*2*pi/n)
j = 0..n-1
Note that y(-j) == y(n-j).conjugate().
Parameters : | x : array_like, real-valued
n : int, optional
axis : int, optional
overwrite_x : bool, optional
|
---|
Notes
Within numerical accuracy, y == rfft(irfft(y)).