Professional Documents
Culture Documents
The Forms of Fourier Representations - v3
The Forms of Fourier Representations - v3
C ONTENTS
References 12
This supplemental note is to help students who take “Signals and Systems” to clarify the
fundamental concept in Fourier representations. Moreover, it tries to help students to build an
intuition why the Fourier and the inverse representations are defined like that in the textbook.
After reading this note, students are expected to be able to answer the following questions:
• Why are the Fourier representations for discrete signals always periodic (DTFS and DTFT)?
• Why are the Fourier representations for periodic signals always discrete (FS and DTFS)?
• Why are the integration intervals for the Fourier representations sometimes from −∞ to ∞
and sometimes from −π to π (FT and DTFT)?
• Why are the integration intervals for the inverse Fourier representations sometimes from
−∞ to ∞ and sometimes from 0 to T (IFT and IFS)?
• Why are the summation elements for the Fourier representation sometimes from −∞ to ∞
and sometimes from 0 to N − 1 (FS and DTFS)?
• Why are the summation elements for the inverse Fourier representations sometimes from
−∞ to ∞ and sometimes from 0 to N − 1 (IDTFT and IDTFS)?
• Why are the normalization factors sometimes N , sometimes 2π, sometimes T , and some-
times 1 (For all four Fourier and inverse Fourier representations)?
• Why are the units for frequencies sometimes Hz, sometimes rad/sec and sometimes rad?
Since the existing problems of the Fourier representations are beyond our scope, we simply
assume the Fourier representations exist for the signals that we discuss herein. The basic concept
of the Fourier representation is to represent a signal x by combining (sum or integral) several
weighted sinusoids which are discrete or continuous in frequency.
Question 1. Suppose that x is periodic, are the frequencies of the sinusoids to represent x
discrete or continuous?
Solution: Let us consider that x is a discrete signal with fundamental period N first. In this
case, the sinusoids are discrete in time and are periodic. Let the periods of the sinusoids be Nk .
Since x is periodic, to represent x, all the periods of the sinusoids must satisfy
N = kNk , (1)
where k must be an integer equal or greater than 1. If (1) is not satisfied, the sinusoids do not
have a common period of N . As a result, there is no way that x can be completely represented
by the sinusoids. From (1), the relationship of the frequencies between x and the sinusoids is
given by
1/N = 1/(kNk ). (2)
From (5) and using the fact that k is an integer, we know that the (angle) frequencies of the
sinusoids are discrete.
Next, let us consider that x is a continuous signal with fundamental period T . In this case,
the sinusoids are also continuous in time and are periodic. By using similar argument as that
for discrete signal, we know that the periods of the sinusoids must also be multiples of T , i.e.
T = kTk , (6)
where Tk are the periods of the sinusoids and k must again be an integer equal or greater than
1. From (6), the relationship of frequencies between x and the sinusoids is given by
From (10) and using the fact that k is an integer, we know that the (angle) frequencies of the
sinusoids are discrete. From the discussion above, we can conclude the following property:
Property 1: The frequencies of the sinusoids to represent a period signal are discrete. We
usually say that a periodic signal have discrete frequency spectrum.
From Property 1, we know that to represent a periodic signal, the frequencies of the sinusoids
are discrete. Now we can write down the relationship between x and the sinusoids. Let us discuss
the relationship for discrete x and continuous x separately as follows:
In this case, let us rewrite x as x[n] to reflect the fact that x is discrete in time. Since x[n]
is discrete in time, the sinusoids to represent x[n] should also be discrete in time. Since x[n] is
periodic, from Property 1 and (5), we let the sinusoids be ejkΩ0 n . Then, x[n] can be represented
by the combination of weighted sinusoids ejkΩ0 n , we have
X
x[n] = X[k]ejkΩ0 n , (11)
k
where X[k] are the weights (or coefficients) at frequency kΩ0 . To determine the range of k in
(11), we are asked how many different frequencies are sufficient to represent x[n]. To answer
this question, we notice that Ω0 = 2π/N . Hence, we have
2π
ejkΩ0 n = ej N kn . (12)
From (12), we observe that ejkΩ0 n is periodic for k with period N , i.e.
2π 2π 2π 2π
ej(k+N )Ω0 n = ej N (k+N )n = ej N kn ej N N n = ej N kn = ejkΩ0 n . (13)
Hence, from (13), we know that given a fundamental frequency Ω0 = 2π/N , we can generate
N different frequencies of sinusoids for all integer k, i.e.
Thus, it is sufficient to use N sinusoids in (17) to represent x[n]. Therefore, we can rewrite (11)
as
N
X −1
x[n] = X[k]ejkΩ0 n , (15)
k=0
which leads to the definition of inverse Discrete-time Fourier Series (IDTFS).
In this case, let us rewrite x as x(t) to reflect the fact that x is continuous in time. Since x(t)
is continuous in time, the sinusoids to represent x(t) should also be continuous in time. Since
x(t) is periodic, from Property 1 and (10), we let the sinusoids be ejkω0 t . Then, x(t) can be
represented by the combination of weighted sinusoids ejkω0 t , we have
X
x(t) = X[k]ejkω0 t , (16)
k
where X[k] are the weights (or coefficients) at frequency kω0 . Now let us determine the range
2π
of k in (16). From (16), the values ejkω0 t = ejk T t for different k are different, since there is no
particular relationship between k and T . Hence, we do not have similar results as that in IDTFS
from Eqs. (11) to (15). Therefore, we know that given a fundamental frequency ω0 = 2π/T , we
can generate infinite different frequencies of sinusoids for all integer k, i.e.
Thus, we need infinite frequencies of sinusoids to represent x(t). Therefore, we can rewrite (16)
as
∞
X
x(t) = X[k]ejkω0 t , (18)
k=−∞
In this case, let us rewrite x as x[n] to reflect the fact that x is discrete in time. Since x[n]
is discrete in time, the sinusoids to represent x[n] should also be discrete in time. In addition,
now x[n] is nonperiodic, hence the frequencies of the sinusoids are continuous. From discussion
above, it is reasonable to let the sinusoids be ejΩn , where the unit of Ω is rads. Thus, x[n] can
be represented by the combination of weighted sinusoids given by
Z
x[n] = A(Ω)ejΩn dΩ, (19)
Ω
where A(Ω) is the weight for sinusoid at frequency Ω. To determine the range of Ω in (19), we
notice that since n is an integer, we know ejΩn is periodic for Ω with period 2π, i.e.
Hence, it is sufficient to use the sinusoids with frequencies in the range where −π < Ω ≤ π to
represent x[n]. Hence, we can rewrite (19) as
Z π
x[n] = A(Ω)ejΩn dΩ. (20)
−π
which is the definition of inverse Discrete-time Fourier Transform (IDTFT). Please note that the
reason to write the new weights as X(ejΩ ) instead of X(Ω) is to reflect the fact that X(ejΩ )
is periodic with period 2π. We will explain later why X(ejΩ ) is period. In addition, we will
explain later why we need to define the new weights.
In this case, let us rewrite x as x(t) to reflect the fact that x is continuous in time. Since
x(t) is continuous in time, the sinusoids to represent x(t) should also be continuous in time. In
addition, now x[n] is nonperiodic, hence the frequencies of the sinusoids are continuous. From
discussion above, it is reasonable to let the sinusoids be ejωt , where the unit of ω is rad/sec.
Thus, x(t) can be represented by the combination of weighted sinusoids given by
Z
x(t) = A(ω)ejωt dω, (23)
ω
where A(ω) is the weight for sinusoid at frequency ω. Please note since t is not an integer,
different values for ω will lead to different frequencies of sinusoids ejωt . Hence, we need to use
the sinusoids with all possible ω to represent x(t). Hence, we rewrite (23) as
Z ∞
x(t) = A(ω)ejωt dω, (24)
−∞
which is the definition of inverse Fourier Transform (IFT). We will explain later why we need
to define the new weights.
In the previous section, we already introduced four different Fourier representations to repre-
sent signals by combining weighted sinusoids. Except the weights, we actually have everything
to represent signals using sinusoids. In this section, we would like to determine the weights. The
detailed derivation of how to determine the weights is beyond our scope. Instead, we give simple
concept to help students gain insight into how to determine the weights. First, let us introduce
the concept of basis.
Definition: A basis B of a vector space V is a linearly independent subset of V that spans (or
generates) V.
where 2 is the weight for b1 , 3 is the weight for b2 and 4 is the weight for b3 , to represent v.
Similar to the vector space, for continuous functions, we may regard the basis B as that it
contains several vectors (may be finite or infinite) and each vector has infinite elements. Since the
functions are continuous, we can use similar representation in (27) and represent a continuous
function v(t) as
XZ
v(t) = b∗k (τ )v(τ )dτ bk (t), (28)
k |τ {z }
ck
R
where b∗k (τ ) is conjugate of bk (τ ). From (28), we can regard ck = τ
b∗k (τ )v(τ )dτ as the projection
of v(t) on bk (t). Since v(t) is obtained by combining bk (t), we can also regard this projection
ck as a “weight” of bk (t) to represent v(t). In this case, we may explain (28) as that function
v(t) is the sum of weighted bk (t).
When the signal x(t) or x[n] is nonperiodic, the weight is no longer discrete. In this case, we
will replace ck by cf , where f is a continuous function of f . Hence, the expression in (28) is
rewritten as Z Z
v(t) = b∗f (τ )v(τ )dτ bf (t)df, (29)
f τ
| {z }
cf
With the concept of (27), (28) and (29), we can explain how to obtain the weights for the
four Fourier representations.
Referring to (15), our goal is to determine the weights X[k]. Comparing (15) and (27), we
can regard ejkΩ0 n as an orthogonal basis to represent x[n]. Hence, referring to (27), the weights
of ejkΩ0 n are obtained by projecting x[n] on ejkΩ0 n , i.e.
X
ck = x[n]e−jkΩ0 n . (30)
n
Since x[n] is periodic with period N , the sinusoids ejkΩ0 n also have a common period of N , the
projection only involves a period of N elements for x[n] and ejkΩ0 n . We can rewrite (30) as
N
X −1
ck = x[n]e−jkΩ0 n . (31)
n=0
To make the pair of DTFS and IDTFS lead to an identity operator, i.e.
Referring to (22), our goal is to obtain the weight X(ejΩ ). Comparing (22) and (27), we can
regard ejΩn as a basis to represent x[n]. Hence, referring to (27), the weights of ejΩn are obtained
by projecting x[n] on ejΩn , i.e.
X
c(Ω) = x[n]e−jΩn . (34)
n
Note that since the frequency spectrum of a nonperiodic signal is continuous, it is more appro-
priate to use c(Ω) instead of ck to represent the weights in (34). Since x[n] is nonperiodic, the
projection in (34) involves infinite elements for x[n] and ejΩn . Hence we can rewrite (34) as
X ∞
c(Ω) = x[n]e−jΩn . (35)
n=−∞
To make the pair of DTFT and IDTFT lead to an identity operator, i.e.
we already multiplied 1/2π in the definition of IDTFT in (22). Hence, there is no need to add
normalization factor for the weights in (35). It can be easily verified that the IDTFT and DTFT
pair in (22) and (35) indeed leads to an identity operator.
Question 3. Is c(Ω) in (35) periodic or nonperiodic?
Solution: Since n is an integer, e−jΩn = e−j(Ω+2π)n is periodic for Ω with period 2π, i.e.
To reflect the fact that the weights of DTFT are periodic, we define a new weight X(ejΩ ) =
c(Ω). Then, we have
∞
X
X(ejΩ ) = x[n]e−jΩn , (37)
n=−∞
which leads to the weight definition of DTFT, i.e DTFT.
From Question 2 and Question 3, we can conclude the following important property.
Property 2: The weights of Fourier representations for discrete signals are periodic. We
usually say that the frequency spectrum of a discrete signal is periodic.
Referring to (18), our goal is to obtain the weights X[k]. Comparing (18) and (28), we can
regard ejkω0 t as an orthogonal basis to represent x(t). Hence, referring to (28), the weights of
ejkω0 t are obtained by projecting x(t) on ejkω0 t , i.e.
Z
ck = x(t)e−jkω0 t dt. (38)
t
Since x(t) is periodic with period T and the sinusoids ejkω0 t also have a common period of T ,
the projection only involves a period of T for x(t) and ejkω0 t . Hence we can rewrite (38) as
Z T
ck = x(t)e−jkω0 t dt. (39)
0
x(t) = IF S {F S {x(t)}} ,
Referring to (26), our goal is to obtain the weight X(jω). Comparing (26) and (29), we can
regard ejωt as a basis to represent x(t). Hence, referring to (29), the weights of ejωt are obtained
by projecting x(t) on ejωt , i.e.
Z
c(ω) = x(t)e−jωt dt. (41)
t
Note that since the frequency spectrum of a nonperiodic signal is continuous, it is more appro-
priate to use c(ω) instead of ck to represent the weights in (41). Since x(t) is nonperiodic, the
projection in (41) involves infinite period for x(t) and ejωt . Hence we can rewrite (41) as
Z ∞
c(ω) = x(t)e−jωt dt. (42)
−∞
x(t) = IF T {F T {x(t)}} ,
we already multiplied 1/2π in the definition of IFT in (26). Hence, there is no need to add
normalization factor for the weights in (42). Letting X(jω) = c(ω), we have
Z ∞
X(jω) = x(t)e−jωt dt, (43)
−∞
which leads to the weight definition of FT, i.e FT. It can be easily verified that the IFT and FT
pair in (26) and (43) indeed leads to an identity operator.
R EFERENCES
[1] S. Haykin and B. V. Veen, Signals and Systems, 2nd Edition, John Wiley & Sons, Inc., 2003.
[2] G. Strang, Linear Algebra and Its Applications, 3nd Edition, Brooks Cole, Inc., 1988.