Signals in Natural Domain

Chapter 6 : Discrete fourier series and Discrete fourier transform

In the last chapter we studied fourier transform representation of aperiodic signal. Now we consider periodic
and finite duration sequences

Discrete Fourier series Representation of a periodic signal

Suppose that is a periodic signal with period N, that is

As is continues time periodic signal, we would like to represent in terms of discrete time complex
exponential signals are given by
 (6.1)

All these signals have frequencies is that are multiples of the some fundamental frequency, , and thus
harmonically related.

These are two important distinction between continuous time and discrete time complex exponential. The first

one is that harmonically related continuous time complex exponential are all distinct for different values
of k , while there are only N different signals in the set.

The reason for this is that discrete time complex exponentials which differ in frequency by integer multiple of
are identical. Thus

So if two values of k differ by multiple of N , they represent the same signal. Another difference between

continuous time and discrete time complex exponential is that for different k have period which
changes with k. In discrete time exponential, if k and N are relative prime than the period is N and not N/k. Thus
if N is a prime number, all the complex exponentials given by (6.1) will have period N. In a manner analogous to
the continuous time, we represent the periodic signal as

(6.2)

where

(6.3)

In equation (6.2) and (6.3) we can sum over any consecutive N values. The equation (6.2) is synthesis equation
and equation (6.3) is analysis equation. Some people use the faction 1 /N in analysis equation. From (6.3) we
can see easily that

Thus discrete Fourier series coefficients are also periodic with the same period N.

Example 1:
So, and , since the signal is periodic with periodic with period 5, coefficients are also
periodic with period 5, and.

Now we show that substituting equation (6.3) into (6.2) we indeed get.

interchanging the order of summation we get

(6.4)

Now the sum

if n - m multiple of N
and for ( n - m ) not a multiple of N this is a geometric series, so sum is

As m varies from 0 to N - 1, we have only one value of m namely m = n , for which the inner sum if non-zero. So
we set the RHS of (6.4) as.

1 2 3 4 5 6

Signals in Natural Domain

Chapter 6 : Discrete fourier series and Discrete fourier transform

Properties of Discrete-Time Fourier Series

Here we use the notation similar to last chapter. Let be periodic with period N and discrete Fourier
series coefficients be then the write

where LHS represents the signal and RHS its DFS coefficients
Signals in Natural Domain
Chapter 6 : Discrete fourier series and Discrete fourier transform

Fourier Transform of periodic signals

If is periodic with period N, then we can write

Using equation (5.9) we see that

as is periodic with period N.

Example:
Consider the periodic impulse train

then

as only one term corresponding to n = 0 is non zero. Thus the DTFT is

1 2 3 4 5 6
Chapter 6 : Discrete fourier series and Discrete fourier transform

Fourier Representation of Finite Duration sequence

The Discrete Fourier Transform (DFT)

We now consider the sequence such that and. Thus can be take non-zero values
only for. Such sequences are known as finite length sequences, and N is called the length of the sequence. If a
sequence has length M, we consider it to be a length N sequence where. In these cases last ( N - M ) sample
values are zero. To each finite length sequence of length N we can always associate a periodic
sequence defined by

(6.16)

Note that defined by equation (6.16) will always be a periodic sequence with period N, whether
is of finite length N or not. But when has finite length N, we can recover the sequence
from by defining

(6.17)

This is because of has finite length N , then there is no overlap between terms and for
different values of.

Recall that if
n = kN + r, where
then n modulo N = r ,

i.e. we add or subtract multiple of N from n until we get a number lying between 0 to N - 1. We will use ((n))Nto
denote n modulo N. Then for finite length sequences of length N equation (6.16) can be written as

(6.18)

We can extract from using equation (6.17). Thus there is one-to- one correspondance between
finite length sequences of length N , and periodic sequences of period N.

Given a finite length sequence we can associate a periodic sequence with it.

This periodic sequence has discrete Fourier series coefficients which are also periodic with
period N.From equations (6.2) and (6.3) we see that we need values of for and for
0 = k =N - 1. Thus we define discrete Fourier transform of finite length sequence as

where is DFS coefficient of associated periodic sequence. From we can get by the
relation.

then from this we can get using synthesis equation (6.2) and finally using equation (6.17). In
equations (6.2) and (6.3) summation interval is 0 to N - 1, we can write X [k ] directly in terms of x[n], and x[n]
directly in terms of X[k] as

For convenience of notation, we use the complex quantity

(6.19)

with this notation, DFT analysis and synthesis equations are written a follows
Analysis equation:

(6.20)
Synthesis equation:

(6.21)

If we use values of k and n outside the interval 0 to N - 1 in equation (6.20) and (6.21), then we will not get
values zero, but we will get periodic repetition of and respectively. In defining DFT, we are
concerned with values only in interval 0 to N - 1. Since a sequence of length M can also be considered a
sequence of length , we also specify the length of the sequence by saying N-point-DFT, of
sequence.

Sampling of the Fourier transform:

1 2 3 4 5 6
For sequence of length N, we have two kinds of representations, namely, discrete time Fourier
Signals in Natural Domain
Chapter 6 : Discrete fourier series and Discrete fourier transform
Properties of the discrete Fourier transform

Since discrete Fourier transform is similar to the discrete Fourier series representation, the properties are
similar to DFS representation. We use the notation

to say that are DFT coefficient of finite length sequence.

1. Linearity

If two finite length sequence have length M and N , we can consider both of them with length greater than or
equal to maximum of M and N. Thus if

then

where all the DFTs are N-point DFT. This property follows directly from the equation (6.20)

2. Circular shift of a sequence

If we shift a finite length sequence of length N , we face some difficulties. When we shift it in right
direction the length of the sequence will becam according to definition.
Similarly if we shift it left , if may no longer be a finite length sequence as may
not be zero for n < 0. Since DFT coefficients are same as DFS coefficients, we define a shift operation which
looks like a shift of periodic sequence. From we get the periodic sequence defined by

We can shift this sequence by m to get

Now we retain the first N values of this sequence

Signals in Natural Domain
Chapter 6 : Discrete fourier series and Discrete fourier transform

Linear convolution using the Discrete Fourier Transform

Output of a linear time invariant-system is obtained by linear convolution of input signal with the impulse
response of the system. If we multiply DFT coefficients, and then take inverse transform we will get circular
convolution. From the examples it is clear that result of circular convolution is different from the result of linear
convolution of two sequences. But if we modify the two sequence appropriately we can get the result of circular
convolution to be same as linear convolution. Our interest in doing linear convolution results form the fact that
fast algorithms for computing DFT and IDFT are available. These algorithms will be discussed in a later chapter.
Here we show how we can make result of circular convolution same as that of linear convolution.

If we have sequence of length L and a sequence of length M , the sequence obtained by

linear convolution has length ( L + M - 1).

This can be seen from the definition

(6.31)

as x[k] = 0 for. For hence. Similarly

for , so. Hence is possibly nonzero only for.
Now consider a sequence , DTFT is given by

writing

We get

If we take

we see that

Comparing this with the DFT equation (6.), we see that

can be seen as DFT coefficients of a sequence

(6.32)

obviously if has length less then or equal to N , then

However, if the length of is greater than may not be equal to for all values of l.
The sequence in equation (6.31) has the discrete Fourier transform

The N-point DFT of sequence is

where and are N-point DFTs of and respectively. The sequence resulting as
the inverse DFT of is then by equation (6.32).

From the circular convolution property of the DFT we have

Thus, the circular convolution of two-finite length sequences can be viewed as linear convolution, followed time
aliasing, defined by equation (6.32). If N is greater than or equal to ( L + M - l ), then there will be no time
aliasing as the linear convolution produces a sequence of length ( L + M - l ). Thus we can use circular
convolution for linear convolution by padding sufficient number of zeros at the end of a finite length sequence.
We can use DFT algorithm for calculating the circular convolution.
1 2 3 4 5 6