Continuous-time fourier transform

In this lab, we learn how to compute the continuous-time Fourier transform (CTFT), normally referred to as Fourier transform, numerically and examine its properties. Also, we explore noise cancellation and amplitude modulation as applications of Fourier transform.

Properties of ctft

The continuous-time Fourier transform (CTFT) (commonly known as Fourier transform) of an aperiodic signal $x(t)$ is given by

The signal $x(t)$ can be recovered from $X(\omega )$ via this inverse transform equation

Some of the properties of CTFT are listed in [link] .

Refer to signals and systems textbooks [link] - [link] for more theoretical details on this transform.

Numerical approximations to ctft

Assuming that the signal $x(t)$ is zero for and $t\ge T$ , we can approximate the CTFT integration in Equation (1) as follows:

where $T=\mathrm{N\tau }$ and N is an integer. For sufficiently small $\tau$ , the above summation provides a close approximation to the CTFT integral. The summation $\sum _{n=0}^{N-1}x(\mathrm{n\tau })e^{-\mathrm{j\omega n\tau }}$ is widely used in digital signal processing (DSP), and both LabVIEW MathScript and LabVIEW have a built-in function for it called fft . In a .m file, if N samples $x(\mathrm{n\tau })$ are stored in a vector $x$ , then the function call

>>xw=tau*fft (x)

calculates

where

with N assumed to be even. The fft function returns the positive frequency samples before the negative frequency samples. To place the frequency samples in the right order, use the function fftshift as indicated below:

>>xw=fftshift(tau*fft (x ) )

Note that $X(\omega )$ is a vector (actually, a complex vector) of dimension N. $X(\omega )$ is complex in general despite the fact that $x(t)$ is real-valued. The magnitude of $X(\omega )$ can be computed using the function abs and the phase of $X(\omega )$ using the function angle .