2 Informal derivation of the Fourier transform

Recall that if f ( t ) is a period T function, which we will temporarily re-write as f T ( t ) for emphasis, then we can expand it in a complex Fourier series,

f T ( t ) = n = c n e i n ω 0 t (1)

where ω 0 = 2 π T . In words, harmonics of frequency n ω 0 = n 2 π T n = 0 , ± 1 , ± 2 , are present in the series and these frequencies are separated by

n ω 0 ( n 1 ) ω 0 = ω 0 = 2 π T .

Hence, as T increases the frequency separation becomes smaller and can be conveniently written as Δ ω . This suggests that as T , corresponding to a non-periodic function, then Δ ω 0 and the frequency representation contains all frequency harmonics.

To see this in a little more detail, we recall ( HELM booklet  23: Fourier series) that the complex Fourier coefficients c n are given by

c n = 1 T T 2 T 2 f T ( t ) e i n ω 0 t d t . (2)

Putting 1 T as ω 0 2 π and then substituting (2) in (1) we get

f T ( t ) = n = ω 0 2 π T 2 T 2 f T ( t ) e i n ω 0 t d t e i n ω 0 t .

In view of the discussion above, as T we can put ω 0 as Δ ω and replace the sum over the discrete frequencies n ω 0 by an integral over all frequencies. We replace n ω 0 by a general frequency variable ω . We then obtain the double integral representation

f ( t ) = 1 2 π f ( t ) e i ω t d t e i ω t d ω . (3)

The inner integral (over all t ) will give a function dependent only on ω which we write as F ( ω ) . Then (3) can be written

f ( t ) = 1 2 π F ( ω ) e i ω t d ω (4)

where

F ( ω ) = f ( t ) e i ω t d t . (5)

The representation (4) of f ( t ) which involves all frequencies ω can be considered as the equivalent for a non-periodic function of the complex Fourier series representation (1) of a periodic function.

The expression (5) for F ( ω ) is analogous to the relation (2) for the Fourier coefficients c n .

The function F ( ω ) is called the Fourier transform of the function f ( t ) . Symbolically we can write

F ( ω ) = F { f ( t ) } .

Equation (4) enables us, in principle, to write f ( t ) in terms of F ( ω ) . f ( t ) is often called the inverse Fourier transform of F ( ω ) and we denote this by writing

f ( t ) = F 1 { F ( ω ) } .

Looking at the basic relation (3) it is clear that the position of the factor 1 2 π is somewhat arbitrary in (4) and (5). If instead of (5) we define

F ( ω ) = 1 2 π f ( t ) e i ω t d t .

then (4) must be written

f ( t ) = F ( ω ) e i ω t d ω .

A third, more symmetric, alternative is to write

F ( ω ) = 1 2 π f ( t ) e i ω t d t

and, consequently:

f ( t ) = 1 2 π F ( ω ) e i ω t d ω .

We shall use (4) and (5) throughout this Section but you should be aware of these other possibilities which might be used in other texts.

Engineers often refer to F ( ω ) (whichever precise definition is used!) as the frequency domain representation of a function or signal and f ( t ) as the time domain representation. In what follows we shall use this language where appropriate. However, (5) is really a mathematical transformation for obtaining one function from another and (4) is then the inverse transformation for recovering the initial function. In some applications of Fourier transforms (which we shall not study) the time/frequency interpretations are not relevant. However, in engineering applications, such as communications theory, the frequency representation is often used very literally.

As can be seen above, notationally we will use capital letters to denote Fourier transforms: thus a function f ( t ) has a Fourier transform denoted by F ( ω ) , g ( t ) has a Fourier transform written G ( ω ) and so on. The notation F ( i ω ) , G ( i ω ) is used in some texts because ω occurs in (5) only in the term e i ω t .