Professional Documents
Culture Documents
Chap 5 PDF
Chap 5 PDF
k=
h[k]x[n k]
h[k]z nk
k=
n
= z
h[k]z k
k=
= H(z)z n
where H(z) =
k=
ak {zkn }
then {y[n]} =
an H(zn ){zkn }
Thus if input signal can be represented by a linear combination of exponential signals, the output can also be represented by a linear combination of
same exponentials, moreover the coecient of the linear combination in the
output is obtained by multiplying,ak , the coecient in the input representation by corresponding eigen value H(zk ).
The procedure outlined above is useful if we can represent a large class of
signals in terms of complex exponentials. In this chapter we will consider
representation of aperiodic signals in terms of signals {ejn }.
|x[n]| < that is {x[n]}
Let {x[n]} be discrete time signal such that
n=
x(e ) =
X(ej )ejn d
(5.1)
x[n]ejn
(5.2)
n=
Equation (5.1) and (5.2) give the Fourier representation of the signal {x[n]}.
Equation (5.1) is referred as synthesis equation or the inverse discrete time
2
(5.4)
1
x[m]ejm e+jn d
x[n] =
2
m=
where we have substituted X(ej ) from (5.2) into equation (5.1) and called
the result as x[n].
Since we have used n as index on the left hand side we have used m as the
index variable for the sum dening the Fourier transform. Under our assumption that {x[n]} sequence is absolutely summable we can interchange
the order of integration and summation. Thus
1
x[m]
e+j(nm) d
(5.5)
x[n] =
2
m=
if m = n
1
2
1 sin (n m)
j cos (n m)
2 (n m)
2
nm
= 0
1
ej(nm) d =
2
Thus in equation (5.5) there is only one non-zero term in RHS, corresponding
to m = n, and we get x[n] = x[n]. This result is true for all values of n
and so equation (5.1) is indeed a representation of signal {x[n]} in terms
eigenfunctions {ejn }
In above demonstration we have assumed that {x[n]} is absolutely summable.
Determining the class of signals which can be represented by equation (5.1)
is equivalent to considering the convergence of the innite sum in equation
(5.2). If we x a value of = 0 then, RHS of equation (5.2) is a complex
valued series, whose partial sum is given by
j0
XN (e
N
)=
x[n]ej0 n
n=N
The limit as N if the partial sum XN (ej0 ) exists if the series is absolutely summable.
|XN (e
j0
N
)| = |
x[n]ej0 n |
n=N
N
n=N
N
|x[n]|
n=N
N
n=N
|x[n]| =
|a|n
n=
n=0
This is a geometric series and sum exists if |a| < 1, in that case
|a|n =
1
< +
1 |a|
Thus the Fourier transform of the sequence {an u[n]} exists if |a| < 1. The
Fourier transform is
j
X(e ) =
=
n=0
ejn
(aej )n
n=0
1
1 aej
(5.6)
Where the last equality follows from sum of a geometric series, which exists
if |aejn | < 1 i.e. |a| < 1.
Absolute summability is a sucient condition for the existence of a Fourier
transform. Fourier transform also exists for square summable sequence.
|x[n]|2 <
n=
For such signals the convergence is not uniform. This has implications in the
design of discrete system for ltering.
We also deal with signals that are neither so absolutely summable nor square
summable. To deal with some of these signals we allow impulse functions,
which is not an ordinary function but a generalized function as a Fourier
transform. The impulse function is dened by the following properties
()d = 1
(a)
(b)
or convolution property)
(c) X(ej )() = X(ej0 )() if X(ej ) is continuous at = 0
Since X(ej ) is a periodic function, let us consider
j
X(e ) =
2( + 2k)
(5.7)
k=
( + 2h)ejn d
h=
()ejn d
X(e ) =
2 ( 0 + 2k), < 0
k=
2( 0 + 2h)ejn d
h=
( 0 )ejn d
5.8
X(e ) = a1
2(1 +2k)+a2
k=
2(2 +2k)+.....+am
k=
k=
(5.9)
Thus X(e ) is a periodic impulse train, with impulses located at the frequencies 1 , 2 ...m of each of the complex exponentials and at all points
that are multiples of 2 from these frequencies. An interval of 2 contains
exactly one impulse from each of the summation in RHS of (5.9)
Example: Let {x[n]} = {cos 0 n}
j
1
1
x[n] = ej0 n + ej0 n
2
2
Hence
X(ej ) =
[( 0 + 2k) + ( + 0 + 2k)]
k=
2(m +2k)
jn
x [n]e
n=
[x[n]ejn ]
n=
x[n]ej()n
n=
j
= X (e
4. Time Reversal
{x[n]} X(ej )
The DTFT of the time reversal sequence is
x[n]ejn
n=
x[m]ejm = X(ej )
m=
XR (ej ) = XR (ej )
8
and
XI (ej ) = XI (ej )
X(ej ) = tan1
n
x[m]
m=
since y[n] y[n 1] = x[n], we are tempted to conclude that the DTFT of
{y[n]} is DTFT of {x[n]} divided by (1 ej ). This is not entirely true
as it ignores the possibility of a dc or average term that can result from
summation. The precise relationship is
n
1
j
j0
x[m]
X(e ) + X(e )
( + 2k)
1 ej
m=
k=
We omit the proof of this property.
If we take {x[n]} = {[n]} then we get
n
1
{u[n]} = {
[n]}
+
( + 2k)
1 ej
m=
k=
10
x[ n ], if n is multiple of k
k
x(k) [n] =
0, if n is not a multiple of k
For example {x(2) [n]} is illustrated below
FIGURE 2
The signal {x(h) [h]} is obtained by inserting (k 1) zeroes between successive value if signal {x[n]}.
X(k) (e ) =
=
x(k) [n]ejn
n=
x[km]ejkm
m=
jk
= X(e
Here we can note the time frequency uncertainly. Since {x(k) [n]} is expanded
sequence, the Fourier transform is compressed.
9. Dientiation in frequency domain
ej
X(e
x[n]ejn
n=
d
j
jnx[n]ejn
X(e ) =
d
n=
{nx[n]} j
10. Passevals relation:
1
|x[n]| =
2
n=
11
|X(ej )|2 d
We have
|x[n]|2 =
n=
x[n]
n=
1
2
X(ej )ejn d
1
2
1
2
X (e )
x[n]ejn d
n=
X (ej )X(ej )d
|X(ej )|2 d
Y (e ) =
=
y[n]ejn
n=
k= h[k]x[n
k] ejn
n=
l=
h[h]
n=
12
x[n k]ejn
k=
h[k]
x[m]ej(m+k)
m=
jk
h[k]e
k=
j
x[m]ejm
m=
j
= H(e )X(e )
Thus if {y[n]} = {h[n]} {x[n]}
then
Y (ej ) = H(ej )X(ej )
(5.20)
convolution in time domain becomes multiplication in the frequency domain. The fourier transform of the impulse response {h[n]} is known as
frequency response of the system.
0.0.1
Z(ej ) =
x[n]y[n]ejn
n=
1
=
X(ej )ejn d y[n]ejn
2
n=
1
2
X(ej )Y (ej() )d
This looks like convolution of two functions, only the interval of integration
is to . X(ej ) and Y (ej ) one periodic functions, and equation (5.21)
is called periodic convolution. This
13
1
X(ej ) Y (ej )
2
where denotes periodic convolution.
We summarize these properties in Table (5.1)
{x[x[n]y[n]}
Aperiodic signal
{x[n]}
{y[n]}
a{x[n]} + b{y[n]}
{x[n n0 ]}
{ejn0 x[n]}
x [n]
x[n]
Table 5.1: Properties of Discrete time Fourier Transform
{x[n]} {y[n]}
{x[n]y[n]}
{x[n] x[n 1]}
{
x[n]}
k=
{nx[n]}
x[n]y [n]
n=
The frequency response of systems characterized by linear constant coefcient dierence equation.
As we have seen earlier, constant coecient linear dierence equation with
zero initial condition can be used to describe some linear time invariant systems.
The input-output {x[n]} and {y[n]} are related by
0
ak y[n k] =
k=0
n
x[n k]
(5.22)
k=0
jk
ak e
Y (e ) =
k=0
M
k=0
14
bk ejk X(ej )
Discre
1
X(ej )
1ej
1
2
or
H(ej ) =
M
Y (ej )
X(ej )
bk ejk
k=0
N
(5.23)
ak ejk
k=0
Thus we see that the frequency response is ratio of polynomials in the variable
ej . The numerator coecients are the coecients of x[n k] in equation
(5.22) and denominator coecients are the coecients of y[n k] in equation
(5.22). Thus we can write the frequency response by inspection.
Example 2: Consider an LTI system initially at rest described by the difference equation
y[n] ay[n 1] = x[n], |a| < 1
The frequency response of the system is
1
1 aej
We can use the inverse fourier transform to get the impulse response
H(ej ) =
h[n] = an u[n]
15