OurBigBook.com $£ Sponsor 中国独裁统治 China Dictatorship 新疆改造中心、六四事件、法轮功、郝海东、709大抓捕、2015巴拿马文件邓家贵、低端人口、西藏骚乱

Discrete Fourier transform of a real signal

See sections: "Example 1 - N even", "Example 2 - N odd" and "Representation in terms of sines and cosines" of www.statlect.com/matrix-algebra/discrete-Fourier-transform-of-a-real-signal

The transform still has complex numbers.

Summary:

$X_{0}$ is real
$X_{1} = \overset{ˉ}{X_{N - 1}}$
$X_{2} = \overset{ˉ}{X_{N - 2}}$
$X_{k} = \overset{ˉ}{X_{N - k}}$

Therefore, we only need about half of

X_{k}

to represent the signal, as the other half can be derived by conjugation.

"Representation in terms of sines and cosines" from www.statlect.com/matrix-algebra/discrete-Fourier-transform-of-a-real-signal then gives explicit formulas in terms of

X_{k}

.

NumPy for example has "Real FFTs" for this: numpy.org/doc/1.24/reference/routines.fft.html#real-ffts

Figure 3.
DFT of $2 sin (t) + cos (4 t)$ with 25 points
. Source at: numpy/fft_plot.py. This plot illustrates how the DFT of a real signal is symmetric around the middle point, and so only half of the transform points are needed to reconstruct the original signal. We also see how the phase of the sinusoids determines if their DFT components are real or imaginary.

 Ancestors (6)

 Incoming links (2)