# Fourier Transform of a Sampled Sequence

July 29, 2019

According to Theorem 1, 𝖸̃(𝜔) is the discrete-time Fourier transform of the sample sequence 𝗒(𝑛). What is the Fourier transform of that sample sequence?

First, let’s note that the Fourier transform is defined for functions over ℝ or ℂ (real or complex). It is not defined for sequences, which are functions over the set of integers ℤ.

However, in an attempt to compute such a transform, it is possible to use the infinity enabled Dirac delta 𝛿(𝑡) to define a comb function 𝗑𝑑 (𝑡) as:

(1) #### Mathematical Definition

Ignoring that real-world ADCs/DACs cannot implement infinite voltage handling, the following equations lead to the mathematical definition of the sampled sequence’s Fourier transform. The result is similar in form to the DTFT in Theorem 1.

 (2) by definition of FT (3) by definition of xd(t) (4) by linearity of integral over t of dt (5) by definition of δ(t) (6) by IPSF (7) by absolute summability property (8) by definition of sample rate Fs

### Conclusion

• 𝖷̃ (𝜔) repeats every 𝜔 = 2𝜋𝖥s radians/second, or every 𝖥s Hertz
• 𝖷̃ (𝜔) reaches 0 at 𝜔 = 1 just as it did pre-sampling (sample rate 𝖥s does not affect the width of the triangle)
• The height of each triangle is 2𝜋𝖥s; the higher the sample rate 𝖥s, the taller the triangle