Analogue and digital techniques in closed loop regulation applications Digital systems • Sampling of analogue signals • Sample-and-hold • Parseval’s theorem.
Download
Report
Transcript Analogue and digital techniques in closed loop regulation applications Digital systems • Sampling of analogue signals • Sample-and-hold • Parseval’s theorem.
Analogue and digital techniques in
closed loop regulation applications
Digital systems
• Sampling of analogue signals
• Sample-and-hold
• Parseval’s theorem
Sampling process
T
Continuous
Function
f(t)
Sampler
(t)
Reconstruction ?
Series of
samples
From time domain to frequency domain
Fourier transform
y(t) is a real function of time
We define the Fourier transform Y(f)
A complex function in frequency domain f
Y (f )
2 jft
y
(
t
)
e
dt
y( t )
2 jft
Y
(
f
)
e
df
Y(f) is the spectral or harmonic representation of y(t)
Frequency spectrum
From time domain to frequency domain
Example of Fourier transform
Y(f)
y(t)
t
-T
T
Y ( f ) 2T
Real even functions
sin( 2Tf )
2Tf
1.2
1
0.8
0.6
0.4
Series1
0.2
0
-6
-4
-2
-0.2
-0.4
0
2
4
6
From time domain to frequency domain
NB: Comments on unit with Fourier function
Use of =2f instead of f
Y() a y( t )e jt dt
1
j t
y( t )
Y
(
)
e
df
2a
a 1,
1
1
,
2 2
Fourier series
a sin(t )
Linear
System b()
Fourier series
Fourier transform
ab() sin(t )
Periodic function
f (t )
t
T
f (t ) f (t kT)
f (t )
2 jnt / T
c
e
n
n
cn
T
t , k
1
cn
T
T / 2
f (t )e
2 jnt / T
T / 2
1
dt
T
= Complex Fourier Coefficients
f(t) a series of frequencies multiple of 1/T
T/2
f (t )e nt dt
T / 2
Fourier coefficients for real functions
1
c n (a n jb n )
2
1
cn (a n jb n )
2
a0
f (t)
[a n cos(nt ) b n sin(nt )]
2 n 1
2
an
T
T
2
f (t) cos(nt)dt
2
bn
T
T
2
a0
2
T
T
2
f (t)dt
T
2
T
2
2
T
f (t) sin(nt)dt
T
2
Principle
a0
f (t )
[a n cos(nt ) b n sin(nt )]
2 n 1
T
a0
{f (t ) [a n cos(nt ) b n sin(nt )]}2 dt
2 n 1
0
0,
To be minimal
0
a n
0
b n
Analysis in frequency domain
f (t ) f (t )(t )
'
n
( t ) T ( t nT)
n
• F ()= Fourier transform of f(t)
• ()= Fourier transform of (t)
• F’ ()= Fourier transform of f’(t)
F' () F() ()
Convolution in the frequency domain
Analysis of ()
n
(T) T ( t nT)
Periodic function
n
(t )
Decomposition in Fourier series
n
c e
n
t / 2
1
cn
f ( t )e
T t / 2
2 jn
t
T
n=-1
t / 2
1
dt
T( t )e
T t / 2
n=0
n=1
0
2
T
cn 1, n
2
T
2 jn
2 jn
t
T
n
t
T
2n
T
dt 1
Analysis of ()
n
n
2n
() (f
) (
)
T n
T
n
n
5
t
4
t
3
t
n
2
t
1
t
0
1
t
n
2
t
3
t
4
t
n
( t nT) (f
)
T
n
n
5
t
f
2
Transform of f’(t)
f ' ( t ) f ( t )( t )
F' () F() ()
Convolution
2n
F' () F()( )d F() (
)d
T
n
2n
2n
F' () F()(
)d F(
)
T
T
n
n
2n
F' () F(
)
T
n
Transform of f’(t)
F' ()
2
s
2f s
T
1
fs
T
F( n )
s
n
F' ()
F( 2s ) F( s ) F() F( s ) F( 2s )
2s
s
0
s
2s
Aliasing
F' ()
0
s
s
s
s
2
2
Primary components
Fundamental components
Complementary
Complementary
components
components
The spectra are overlapping (Folding)
s
Folding frequency
2
Requirements for sampling frequency
• The sampling frequency should be at least twice as large as
the highest frequency component contained in the continuous
signal being sampled
• In practice several times since physical signals found in the
real world contain components covering a wide frequency range
•NB:If the continuous signal and its n derivatives are sampled
at the same rate then the sampling time may be:
n 1
T
2f h
f h highest frequency component
Can we reconstruct f(t) ?
f’(t)
f(t)
f °(t)
Sampler
Filter
F' ()
1
2c
Window
Wc ()
2s
s
0
s
2s
c
c
In the frequency domain
F() F' ()Wc ()
Back to time domain
Convolution
F() F' ()Wc ()
f (t ) f ' (t ) w c (t )
f ( t ) f ' () w c ( t )d
Window in the time domain
1
w c (t)
2c
c
e
2 j t
c
sin( c t ) sin( 2f c t )
d
c t
2f c t
f’(t) in the time domain
f ' ( t ) f ( t )( t )
n
f (nT)(t nT)
n
Back to time domain
f ( t ) f ' () w c ( t )d
sin c ( t )
f (t ) f (nT)( nT)
d
c ( t )
n
nT
sin c ( t nT)
f ( t ) f (nT)
c ( t nT)
n
sin 2f c ( t nT)
f ( t ) f (nT)
2f c ( t nT)
n
Reconstruction
f(t)
sin 2f c ( t nT)
i( t )
2f c ( t nT)
i( t nT) 1
i( t kT) 0
t
nT
(n+1)T
Interpolation functions
(n+2)T
(n+3)T
Delayed pulse train
t
T(1 )
T
T(1 )
T(2 )
2
T
0 1
T
2
1
1 jnT
1 j2 n
jnt
Cn
( t T)e
e
e
T T
T
T
2
(t )
jnT jnt
e
e
n
jn( t T )
e
n
Analogue and digital techniques in
closed loop regulation applications
Zero-order-hold
Reconstruction of sampled data
To reconstruct the data we have a series of data
f (kT), k 1,2,3,4,....................n
1
f ( t ) f [kT] f '[kT]( t kT) f ' '[kT]( t kT) 2 ..
2!
Approximation
1
f '[kT] {f [kT] f [( k 1)T]}
T
1
f ' '[kT] {f '[kT] f '[( k 1)T]}
T
A device which uses only the first term f[kT] is called a
Zero-order extrapolator or zero-order-hold
Sample-and-Hold devices
kT
z 0 Source x e (t)
c
x s (t)
z
x s (kT )
x e (t)
x s (kT )
k-2
k -1
k
k 1 k 2 k 3
t/t
x s (kT) x e (kT).[u(kT)- u((k 1)T]
Droop
Sample-and-hold circuit
Input signal
Ts
Ta
Tp
t
Output signal
Hold mode
Ta = Acquisition time
Sample mode
Tp = Aperture time
Hold mode
Ts = Settling time
Laplace transform of output
x o (t) x s (kT )
k
X o (s) x e (kT ).[u(kT )- u((k 1)T ].e-st dt
0 k
Xo (s) x e (kT)
( k 1) T
k
Xo (s) x e (kT)[
k
st
[
u
(
k
T
)
u
((
k
1
)
T
)]
e
dt
kT
ksT
e
s
e( k 1) T
]
s
1 esT
Xo (s)
[ x e (kT).eskT ]
s
k
Transfer function
(t )
h(t )
F(s)
Impulse response
F(s)=L[h(t)]
h(t)
(t)
t
t
k=0
x e (kT)e
k
sk T
1
1 e sT
X o (s)
s
s j
Transfer function
jT
1 e
F() X o ()
j
2 j
1 e
j
s
2 e
.
s
j
s
2 sin(u) ju
F() .
.e
s u
2
s 2f s
T
u
s
j
s
e
2j
s
(e
j
s
)
)
s
s
sin(
1.2
1
0.8
0.6
0.4
Series1
0.2
0
-0.2
-0.4
0
1
2
3
4
5
6
s
) j
s
e s
s
sin(
F()
Phase of F()
0
2
3
4
5
s
2s
3s
4s
Parseval’s theorem
x(t) and y(t) have Fourier transform X(f) and Y(f) respectively
x ( t ) y( t ) x () y( t )d
Convolution
x ( t ) y( t ) F1[X(f )Y(f )] X(f )Y(f )e 2 jft df
2 jf ' t
x
(
t
)
y
(
t
)
e
dt X(f )Y(f 'f )df
x (t ) y(t )dt X(f )Y(f )df
x (t ) y * (t )dt X(f )Y * (f )df
f’=0
y(t)y*(t)
Parseval’s theorem
x (t ) y * (t )dt X(f )Y * (f )df
x(t)y(t)
x (t )x * (t )dt X(f )X * (f )df
x(t)
2
2
dt X(f ) df
This expression suggests that the energy of a signal
Is distributed in time with a density
x(t)
Or is distributed in frequency with density
2
X (f )
2