Professional Documents
Culture Documents
1
ak =
N
$ j2kn &
x[n]exp% N '
n= 0
Analysis Equation
1 N1
# j2kn %
x[n] = ak exp
$ N &
N k= 0
Example:
See fig 3.1. Waveform with a period of 7 samples per cycle. Equation 1
is complex and has to be split into two parts for computation:
1 ) N1
$ j2kn & N 1
$ j2kn & ,
ak = * x[n]Cos
+ j x[n]Sin
%
'
%
'
N + k= 0
N
N
.
k=0
Real Part
Imaginary
of ak
Part of ak
0.4 285 715
0
0.3 018 007
-0.1 086 581
0.7 864 088
0.3 847 772
-0.3 024 935
-0.6 687 913
-0.3 024 928
0.6 687 927
0.7 864 058
-0.3 847 782
0.3 018 006
0.1 086 581
1 6
$ 2kn &
Re(ak ) = x[n]Cos
% N '
7 n= 0
1 6
$ 2kn &
Im(ak ) = x[n]Sin
% N '
7 n= 0
ak = Re (ak ) + Im( ak )
$ Im(ak ) '
k = Tan %
(
& Re (ak ))
1
# n %
# n %
x[n] = 1+ Sin
+ 2Cos
$ 4 &
$ 2 &
dc cmpt
(offset)
8 samples
per cycle
4 samples
per cycle
It is clear that a full cycle of x[n] will require its evaluation over the 'n'
range, 0n7:
n
X[n]
0
3.000
1
1.707
2
0.000
3
1.707
4
3.000
5
6
0.293 -2.000
7
0.293
# n % 1 ( # jn %
# jn %+
Sin
=
exp
exp
$ 4 & 2 j *) $ 4 &
$ 4 &-,
# n % 1 ( # jn %
# jn %+
Cos
= exp
+ exp
$ 2 & 2 *) $ 2 &
$ 2 &-,
So we can now write x[n] as:
1 ( # jn %
# jn %+ 1 ( # jn %
# jn %+
x[n] = 1+ *exp
exp
+ *exp
+ exp
$ 4 &, 2 ) $ 2 &
$ 2 &-,
2j ) $ 4 &
# n %
# n %
x[n] = 1+ Sin
+ 2Cos
$ 4 &
$ 2 &
j
$ jn & j
$ jn &
$ 2 jn &
$ 2 jn &
x[n] = 1+ exp
exp
+ exp
+ exp
% 4 ' 2
% 4 '
% 4 '
% 4 '
2
N1
% + jkn '
x[n] = ak exp
& 4 (
k= 0
Re(ak)
1
0
1
0
1
0
0
0
Im(ak)
0
0.5
0
-0.5
0
0
0
0
|ak|
1
0.5
1
0.5
1
0
0
0
k
0
/2
0
/2
0
0
0
0
Notes:
If x[n] = -x[-n], i.e., x[n] is an odd function of 'n', then all Re(ak) = 0
or equivalently, odd periodic signals can be constructed from 'Sine' fns
Conversely, if x[-n] = x[n], i.e., x[n] is an even function of 'n', then all Im(ak)
= 0 and so even periodic signals can be constructed from 'Cosine' fns
But phase
spectrum
shifted by
extra factor
Differentiation
if x[n] ak, then x[n] - x[n-1] ak {1 - exp[-j2k/N]}
1st order difference of
x[n] differentiation
)
% 2 jk ' ,
x[k] ak *1 exp& N (+
.
k=
Convolution
if x1[n] ak and x2[n] bk, then
N1
Convolution over a
single cycle of 'N'
data points
(f)
Circular Convolution
x1 .x 2
a b
m k m
m=0
1
N
n= N1
( x[n]) =
n= 0
Average Energy/Cycle
in the Time Domain
k= N 1
2
(
)
a
k
k= 0
Average Energy/Cycle
in the Frequency Domain
1
ak =
N
N 1
$ j2kn &
x[n].exp% N '
n= 0
2k/N
DFS
'DFT'
X () = Nak =
x[n]exp( jn)
n=
Continuous Fourier
Transform of a discrete
sampled signal x[n]
2
Let0 =
= thefundamentalfrequency
N
N1
% j2kn '
x[n] = ak exp
& N (
k= 0
# X (k 0 ) &
x[n] = %
exp( jkn0 )
(
N '
k= 0 $
N1
1 N1
x[n] =
X ( k0 ) exp( jkn0 )0
2 k= 0
N1
k0 and
k= 0
1
x[n] =
2
X () exp( jn)d
0
X () =
x[n]exp( jn)
n=
0.5
=
1 0.5exp( j)
X () = X () X ()
X () =
0.5
(1.25 Cos)
1
2
n=
X () =
x[n]exp( jn)
n=
[n]exp( jn)
n=
= 1.exp(0) = 1 !!!!!!!!!
() = () () = 1
& Im[ ()] )
() = Tan '
*=0
( Re[()] +
1
Time Shifting:
x[n-n0] X()exp(-jn0)
Convolution:
Digital LTI
Processor
't' domain
x[n]
h[n]
'' domain
X()
H()
y[n] = h[n]*x[n]
Y() = H() x X()
0.5
Correspondingly: H() =
1 0.5exp ( j)
And:
H () =
0.5
(1.25 Cos())
0. 5
l= I
c y[n l] = d x[n l]
l
l=0
l= 0
where 'L' is the order of the system and cl are the recursive
multiplier coefficients. Taking Fourier Transforms of both sides:
l= L
l= I
l=0
l= 0
d exp( jl)
Y ()
So we can write: H () =
=
X ()
c exp( jl)
l
l= 0
l=L
l= 0
x[n]
-
+
y[n]
+
-
0.8
c1
d0
d1
d exp ( jl)
l
Using: H () =
l= 0
l= L
c exp( jl)
l
l=0
1 exp( j)
H() =
1+ 0.8.exp( j)
1 Cos + jSin
H () =
1+ 0.8Cos 0.8 jSin
H () =
[(1 Cos)
[(1+ 0.8Cos)
1/ 2
+ Sin
+ 0.64Sin
1/ 2
$ 2 2Cos &
So we can write: H () =
%1.64 1.6Cos'
% ImH () (
Phase Spectrum: H () = Tan '
& Re H () *)
1
& Sin (
1 & 0.8Sin (
H () = Tan
Tan
'1 Cos )
'1+ 0.8Cos )
1
Cf: Fig 3.11 for plots of magnitude |H()| and phase H()
transfer functions or 'gain profiles'
The processor is a High Pass Filter with a gain of 10 @ =
Program no 9 to investigate 90, 91 & 92. Figs 3.12 & 3.13