Documente Academic
Documente Profesional
Documente Cultură
\
|
|
.
2 t f
t
2
:=
t 1 := f 4 3.9 , 4 .. := F f ( )
t sin 2 t f
t
2
\
|
|
.
2 t f
t
2
:=
4 3 2 1 0 1 2 3 4
1
0.5
0
0.5
1
1.5
2
t
2
|
\
|
|
.
F f ( )
f
1/t
1/T
3/T
5/T
2/T
7/T
Comparison of Result: FS and FT
The Sinc Function is the Fourier Transform of a
pulse wave.
If the pulse waveform has 50% duty cycle, it
will contain First, Third and Fifth Harmonics as
shown by arrows. Their respective amplitudes
are 1, 1/3, 1/5,1/7 etc.
The second, fourth, sixth or, all odd
harmonics are essentially zero.
The results are compatible with the results of FS
.
What if the duty cycle is not 50%?
We
discuss
Fourier Transform of Gated
Cosine wave
-2 -1.5 -1 -0.5 0 0.5 1 1.5 2
-1
-0.5
0
0.5
1
t
x
(
t
)
-20 -15 -10 -5 0 5 10 15 20
-0.5
0
0.5
1
1.5
f
X
(
f
)
gated cosine
Fourier
Transform
FT of gated wave..
In the above slide, 20 cycles of cosine
wave passes through a pulse type gate
function in the duration -1 to 1 seconds.
In time domain, the cosine wave function
multiplies with the gate function.
It corresponds to convolution in frequency
domain of FT of cosine wave with FT of
pulse function.
FT of a Pulse: a sinc fn.
.
F f ( )
T sin 2 t f
T
2
\
|
|
.
2 t f
T
2
:=
t 1 := f 4 3.9 , 4 .. := F f ( )
t sin 2 t f
t
2
\
|
|
.
2 t f
t
2
:=
4 3 2 1 0 1 2 3 4
1
0.5
0
0.5
1
1.5
2
t
2
|
\
|
|
.
F f ( )
f
1/t
CTFT
The Inverse of this Fourier Transform
(ICTFT) returns result in time domain.
Proportional Fourier Series components
can be found by drawing ordinates at
the frequencies [0:1:]/T; where T is the
time period of the signal.
Likewise, by smoothening and normali-
zing the ordinate points of FS of x(t), one
can arrive at plots of CTFT of x(t).
CTFT
While the shape of the signal decides the
magnitude characteristics, the phase
depends on the position of the ordinate.
Fourier Transform is more flexible to use
compared to Fourier Series.
CTFT is closely related to Laplace-
Transform (LT) and linear time invariant
differential equations.
The frequency response pertains to
steady state time response.
CTFT.
note
Discrete Time Fourier
Transform [DTFT]
It is an extension of CTFT.
One cycle of periodic signal x(t) of
periodicity T
p
=(1/f
p
)(now non periodic), is
continuously sampled by an ideal impulse
switch at an interval T
s
(=1/f
s
).
The time sampled output is modeled as
x
s
(nT
s
) = x(t). E o(t nT
s
); [- n ].
DTFT
In frequency domain, since
x(t) = X(f) and
o(t - n/f
s
) = o(f - nf
s
).
The x
s
(nT
s
) = x(t). E o(t nT
s
);
= X(f)* o(f - nf
s
): range [- n ].
Thus in DTFT, the spectra of aperiodic x(t)
repeats
at every nf
s
:range [- n ].
repeats
DTFT
We define Digital Frequency F
D
=
f/f
s
s .
The principal range is a normalized frequency range lie
between [-t:t] rad/sec or, [-0.5:0.5] Hz.
As per Nyquist, should F
D
lie within the principal range,
the sampled output will be alias free.
In DTFT, the principal range repeats every 1/f
s
.
If F
D
< 0.5; signal lie within principal range;
case of over sampling, no aliasing.
If F
D
= 0.5; it is critical, Nyquist minimum rate.
If F
D
>1/2; signal extends beyond principal range;
case of under sampling. Aliased
signals generated.
.
DTFT
The DTFT is Fourier Transform of a Discrete
Time signal x[n]; is concerned with the
(a) sampling function, that in ideal case is
the impulse train in frequency o(f-k/T)
and
(b) Fourier transform X(f) of the signal x(t).
The result is termed as
Discrete Time Fourier Transform or, DTFT.
The spectra of x[n] is continuous in the
principal range and repeats after every f
s
in the
frequency range of [- :].
DTFT.
In short, the frequency spectra of
CTFT repeats in DTFT after every
2t rad in the range [-t:t].
Alternatively
The Digital Frequency Plot repeats
after every cycle in the range [-
F
D
/2:F
D
/2] and normalized to [-
0.5:0.5] on frequency scale of Hz.
DTFT.
DTFT after calculation, turns out to be a
complex quantity. It can be expressed in
either cartian or, polar form.
DTFT relates to z-transform and linear
difference equations with constant
coefficients [ D = e
- jO
= z
-1
] .
Interpolation and extrapolation are
feasible.
Refer: Ambarder: PP482:484
DTFT..
Note with
care
DTFS
It is an extension of CTFS.
A time domain signal x(t) of periodicity T
is sampled at a regular interval T
s
(=1/f
s
)
where NT
s
=T and N is the number of
samples per cycle is an integer.
The sampled signal is denoted by x[nT ]
or, simply by x[n].
The frequency spectra and time-wave,
both are discrete.
The discrete-time waveform as well as
discrete frequency spectra, both are
periodic.
DTFS
CTFS has aperiodic discrete spectra in the
entire frequency range; while in DTFS, a
limited spectra is copied and pasted after
every nf
s
:n is an integer in the range [].
Being a finite and discrete length of series
between n and n-1, DTFS has no
convergence issue.
Most properties of CTFS/CTFT/DTFT are
alike.
The DTFS and DFT are related to each other
by the relation X[k] = NC
k
.
DTFS and DFT
The important features of DFT are:
One-to-one correspondence between x[n] and
X[k].
Fast Fourier Transform (FFT) is available for
calculations.
DTFS is related to DTFT in the same way as
CTFS is related to CTFT.
Due to its finite discrete length N in time and
same in frequency domains, DFT is most
appropriate Fourier representation for digital
simulation.
DTFS