Fourier Properties X 4

Overview of Fourier Representation Properties Review of Signal Types
Range of equations (nite versus innite) DT Periodic DT Fourier Series

Signal and transform classes (periodic versus nonperiodic) CT Periodic CT Fourier Series
DT Nonperiodic DT Fourier Transform
Linearity CT Nonperiodic CT Fourier Transform
Time and frequency shifts
We have discussed two categories of signals
Symmetry of transforms Continuous-time & discrete-time
Transform relationship to signal symmetry Periodic and nonperiodic
Amplitude/phase representations Each combination of these properties has an appropriate transform
Time and frequency scaling Keep in mind
Convolution: nonperiodic versus periodic signals Periodic signals are power signals
Multiplication The CTFT and DTFT usually only converge for energy signals
Parsevals theorem Can be applied to periodic and almost periodic signals if we
allow the CTFT and DTFT to include impulses
Duality
J. McNames Portland State University ECE 223 Fourier Properties Ver. 1.11 1 J. McNames Portland State University ECE 223 Fourier Properties Ver. 1.11 2
Fourier Series & Transform Summary Fourier Series & Transform Observations
Periodic signals can be represented as a sum of sinusoids
1
DTFS x[n] = X[k] ejko n X[k] = x[n]ejko n Nonperiodic signals can be represented as an integral of sinusoids
N
k=<N > n=<N >
DT signals
1
CTFS x(t) = X[k] e jko t
X[k] = x(t)e jko t
dt Can be represented by a finite frequency range
T T
k= Have transforms that are periodic

+
DTFT x[n] =
1
X(ej ) ejn d X(ej ) = x[n] ejn X[k] = X[k + N ] X(ej ) = X(ej(+2) )
2 2 n=
+ + This is a consequence of ejn = ej(2)n
1
CTFT x(t) = X(j) ejt d X(j) = x(t) ejt dt CT signals
2
Must be represented by an infinite frequency range, in general
Have transforms that are nonperiodic, in general
Each transform has a synthesis and analysis equation
X[k] = X[k + N ] X(j) = X(j( + o ))
Each transforms the signal (function of time) into a function of
frequency This is because ej1 t = ej2 t unless 1 = 2
Notes on Terminology Property 1: Linearity
Many of the transforms share the same properties FS
a1 X1 [k] + a2 X2 [k]
The following slides cover the primary properties of the transforms a1 x1 [n] + a2 x2 [n] FT
a1 X1 (ej ) + a2 X2 (ej )
I will use the word transform generally to refer to both the Fourier FS
series transforms and the Fourier transforms a1 X1 [k] + a2 X2 [k]
a1 x1 (t) + a2 x2 (t) FT
The book avoids this and uses the word representation a1 X1 (j) + a2 X2 (j)
All of the Fourier transforms are linear

This follows directly from the linearity property of sums and
integrals
Note that for periodic signals, both components must have the
same fundamental period
Example 1: Linearity Application Example 1: Applying the Denition

Derive one of the four linearity relationships given on the previous slide. Suppose two people sing into a microphone at the same time. Under
what conditions is it possible to design a linear time-invariant lter
that separates one of the voices? What characteristics would you want
the lter to have?
Application Example 1: Workspace Application Example 2: Applying the Denition
Suppose you obtain an old recording of a song that you like that is
corrupted with a constant humming background noise. Is it possible to
design an LTI lter that will eliminate the humm? What
characteristics would you want the lter to have? How much would it
distort the original signal?
Application Example 2: Workspace Property 2: Time Shift

FS
ejko no X[k]
x[n no ] FT
ejno X(ej )
FS
ejko to X[k]
x(t to ) FT
ejto X(j)
What eect does a time shift have on even/odd symmetry in

general?
What eect does a time shift have on phase?
Suppose the phase of the Fourier representation is zero at all
frequencies. What is the eect of shifting the signal?
What eect does a time shift have on amplitude?
Example 2: Time Shift Example 2: Workspace
Derive one of the four time-shift relationships on the previous slide.
Application Example 3: Speaker Recognition Application Example 3: Workspace

Suppose you are asked to design a security system that only allows a
single authorized person to open a door. To conrm the persons
identity, they must press a button and speak a password.
How would you design such a system?
How would you account for the variable delay between the start of
the signal (when they push the button) and when they speak the
word?
How would you prevent an intruder from entering even if they say
the same password?
Application Example 3: Workspace Property 3: Frequency Shift
FS
ejks o n x[n] X[k ks ]
FT
ejs n x[n] X(ej(s ) )
FS
ejks o t x(t) X[k ks ]
FT
ejs t x(t) X (j( s ))
s and s is the frequency of the modulating complex sinusoid

For periodic signals the modulating complex sinusoid must be an
integer multiple of the fundamental frequency, ks o (why?)
What eect does multiplying (modulating) a signal with a
complex sinusoid have?
Example 3: Frequency Shift Example 3: Workspace

Derive one of the four frequency-shift relationships on the previous
slide.
Application Example 4: Communications Channel Example 4: Workspace
Suppose you wish to transmit a stereo signal over a single telephone
line. You can model a telephone line as a lowpass lter with a 4 kHz
passband.
How can you combine the two signals into a single signal in such a
way that you can extract the original signals?
What must you compromise in combining the two signals into a
single signal?
What properties must the signals have in order to send them over
the telephone line without loss?
Example 4: Workspace Property 4: Transform Symmetry
X[k] = X [k] X(ej ) = X (ej ) X(j) = X (j)
Each transform can be used to synthesize the signal as a sum or

integral of complex sinusoids
The resulting signal is real
Thus all the imaginary components must cancel (sum or integrate
to zero)
This results in the complex-conjugate symmetry of the coecients
Example 4: Transform Symmetry Example 4: Workspace
Derive one of the four complex-conjugate symmetry relationships listed
on the previous slide given that the signal is real-valued.
Property 4: Transform Symmetry Continued Property 5: Transform Relationship to Signal Symmetry

If the signal is real, then the transforms are complex-conjugate
xe [n] = 1
2 (x[n] + x[n]) xe (t) = 1
2 [x(t) + x(t)]
symmetric about the origin
xo [n] = 1
(x[n] x[n]) xo (t) = 1
[x(t) x(t)]
X[k] = X [k] X(ej ) = X (ej ) X(j) = X (j)
2 2
x[n] = xe [n] + xo [n] x(t) = xe (t) + xo (t)
This implies
The real part of the transforms are even
The imaginary part of the transforms are odd Every signal can be expressed as a sum of even and odd signals
The magnitude is even Even signals can be represented as a sum or integral of cosines
The phase is odd Odd signals can be represented as a sum or integral of sines
When this symmetry is present, it is only necessary to consider The real part of the Fourier coecients represent the coecients
and plot the transforms for positive frequencies of the cosines
The imaginary part of the Fourier coecients represent the
coecients of the sines
Property 5: Transform Relationship to Signal Symmetry Example 5: Transform Relationship to Signal Symmetry
If the signal is real, then Derive one of the eight relationships listed on the previous slide given
FS FS that the signal is real-valued. Hint: use the complex-conjugate
Re{X[k]} Im{X[k]} symmetry of the transform.
xe [n] F T xo [n] FT
Re{X(ej )} Im{X(ej )}
FS FS
Re{X[k]} Im{X[k]}
xe (t) F T xo (t) FT
Re{X(j)} Im{X(j)}
Even signals have Fourier coecients that are real

Odd signals have Fourier coecients that are imaginary
Signals without even or odd symmetry are complex
Example 5: Workspace Property 6: Amplitude-Phase Representation

If the signal is real, each of the synthesis equations can be written as
N/2

x[n] = A[k] cos(ko n + [k])
k=0

1
x[n] = A(ej ) cos n + (ej ) d
0

x(t) = A[k] cos(ko t + [k])
k=0

1
x(t) = A(j) cos (t + (j)) d
0
The magnitude of the Fourier coecients represents the

magnitude of a combination of cosine and sine at each frequency
Complex phase angle of the coecients represents the phase of
the combined cosine
Example 6: Transform Relationship to Signal Symmetry Example 6: Workspace
Derive one of the amplitude-phase forms listed on the previous slide
given that the signal is real-valued. Hint: use the complex-conjugate
symmetry of the transform.
Example 6: Workspace Amplitude/Phase versus Real/Imaginary Plots

Engineers often plot the Fourier transforms versus frequency as
part of signal analysis
This can lead to insights that guide design
The transforms are complex-valued functions of frequency
Requires two plots to fully represent
Two obvious choices
Rectangular coordinates: Real and imaginary components
versus frequency
Polar coordinates: Amplitude and phase versus frequency
Recall:
Real component corresponds to even component of signal
Imaginary component corresponds to odd component of signal
But an even/odd signal decomposition, x(t) = xe (t) + xo (t), is
rarely helpful in practice
Application Example 5: Polar versus Rectangular Application Example 5: Polar versus Rectangular
Use the fast Fourier transform to estimate the CTFT over a range of Linus: Philosophy of Wet Suckers
frequencies from 0 to half the sampling rate, fs /2, of a 60 ms segment 0.2
of speech.
0.15
What insights do you gain from studying the FT plots that you
0.1
did not gain from studying a time-domain plot?
0.05
What type of properties would a communications channel require
to transmit this signal? 0
What insights do you gain from studying the real, imaginary, 0.05
amplitude, and phase plots. 0.1
0.15
0.2
0.25
1.6 1.61 1.62 1.63 1.64 1.65

Time (sec)
Application Example 5: Polar versus Rectangular Application Example 5: Polar versus Rectangular
15 20
FT Magnitude
10
15
Real FT
5
0 10
5
5
10
0
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000 5500 0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000 5500
200
FT Complex Phase (degrees)
20
100
Imaginary FT
10
0
0
100
10 200
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000 5500 0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000 5500
Frequency (Hz) Frequency (Hz)
Application Example 5: MATLAB Code set(h,LineWidth,0.6);
xlim([min(f) max(f)]);
ylim([1.05*min(real(X(k))) 1.05*max(real(X(k)))]);
function [] = Speech(); set(gca,XTick,[0:500:max(f)]);
close all; AxisLines;
box off;
[x,fs,nbits] = wavread(WetSuck.wav); ylabel(Real FT);
subplot(2,1,2);
k = round(fs*1.6):round(fs*1.66); % Look at only 0.5 s h = plot(f,imag(X(k)),r);
x = x(k); set(h,LineWidth,0.6);
nx = length(x); xlim([min(f) max(f)]);
ylim([1.05*min(imag(X(k))) 1.05*max(imag(X(k)))]);
figure; set(gca,XTick,[0:500:max(f)]);
FigureSet(1,LTX); AxisLines;
t = (k-1)/fs; box off;
h = plot(t,x,b); ylabel(Imaginary FT);
set(h,LineWidth,0.6); xlabel(Frequency (Hz));
xrng = max(x)-min(x); AxisSet(6);
xlim([min(t) max(t)]); print -depsc SpeechFTRectangular;
ylim([min(x)-0.01*xrng max(x)+0.01*xrng]);
AxisLines; figure;
xlabel(Time (sec)); FigureSet(1,LTX);
ylabel(); subplot(2,1,1);
title(Linus: Philosophy of Wet Suckers); h = plot(f,abs(X(k)),r);
box off; set(h,LineWidth,0.6);
AxisSet(8); xlim([min(f) max(f)]);
print -depsc Speech; ylim([0 1.05*max(abs(X(k)))]);
set(gca,XTick,[0:500:max(f)]);
X = fft(x,2^(max([12,nextpow2(nx)]))); box off;
nX = length(X); ylabel(FT Magnitude);
k = 1:floor((length(X)+1)/2); subplot(2,1,2);
f = (k-1)*(fs)./(nX+1); h = plot(f,angle(X(k))*180/pi,r);
set(h,LineWidth,0.6);
figure; xlim([min(f) max(f)]);
FigureSet(1,LTX); ylim([-200 200]);
subplot(2,1,1); set(gca,XTick,[0:500:max(f)]);
h = plot(f,real(X(k)),r); AxisLines;
box off;
ylabel(FT Complex Phase (degrees)); Amplitude/Phase versus Real/Imaginary Plots Continued
xlabel(Frequency (Hz));
The most useful plot is amplitude (or squared amplitude) of the

AxisSet(6);
print -depsc SpeechFTPolar;
transform versus frequency

Only need to plot transform for positive frequencies (why?)
Examining the phase is rarely useful for signal analysis
Phase is sensitive to time-shift of signal
Phase is bounded:
Phase is important for system analysis
Consider bode plots
Linearity of phase is an important consideration
More on this later
Property 7: Convolution of Nonperiodic Signals Example 7: Nonperiodic Continuous-Time

Derive either the DT or CT relationship between the convolution of
x[n] h[n] = h[k]x[n k] = x[k]h[n k] two signals and their transforms
k= k= FT FT
x(t) h(t) X(j)H(j) or x[n] h[n] X(ej )H(ej )
x(t) h(t) = h( )x(t ) d = x( )h(t ) d

Convolution is dened dierently for periodic and nonperiodic

signals
We will discuss convolution for nonperiodic signals rst
This is the convolution you are already familiar with
Example 7: Workspace Property 7: Convolution Concepts
FT FT
x[n] h[n] X(ej )H(ej ) x(t) h(t) X(j)H(j)
This is very similar to what we used the Laplace transform for
Key dierences
Can be applied to two-sided signals
Cannot be applied to signals with innite energy
Works in discrete-time as well as continuous-time
Enables us to think of a system in terms of how it scales and
shifts the complex phase angle of each complex sinusoid
component of the signal
This is very useful if we have a good notion of which components
are present in a signal via the Fourier transform
Property 8: Convolution of Periodic Signals Example 8: Convolution of Periodic Signals
Derive either the DT or CT relationship between the convolution of
FS
x(t) z(t) = x( )z(t ) d x(t) z(t) T X[k]Z[k] two signals and their transforms
<T >
FS FS FS
x[n] z[n] = x[k]z[n k] x[n] z[n] N X[k]Z[k] x(t) h(t) T X[k]Z[k] x[n] h[n] N X[k]Z[k]
k=<N >
Convolution of periodic signals occurs in signal analysis, but not

system analysis
This is because stable systems do not have impulse responses that
are periodic
Nonetheless, convolution is useful for signal analysis
Example 8: Workspace Property 9: Dierentiation and Integration

These are listed in the book (Table 3.6)
They are very similar to the corresponding Laplace transform
properties
In most cases, these are handled with other transforms
Dierential equations are usually handled with the Laplace
transform
Dierence equations are handled with the z transform
Property 10: Signal Multiplication Example 9: Signal Multiplication
FS Derive one of the four relationships on the previous slide.
x[n] z[n] X[k] Z[k]
FT 1
x[n] z[n] X(ej ) Z(ej )
2
FS
x(t) z(t) X[k] Z[k]
FT 1
x(t) z(t) X(j) Z(j)
2
Recall that convolution in the time domain is equivalent to
multiplication in the frequency domain
This shows that multiplication in the time domain is equivalent to
convolution in the frequency domain
Recall that the DT transforms are periodic and the CT transforms
are non periodic
Naturally, it works out that the DT transforms have circular
convolution and the CT transforms have ordinary convolution
Example 9: Workspace Windowing

wT (t)x(t) |t| T
xs (t) = wT (t)x(t) =
0 |t| > T
T
Xs (j) = wT (t)x(t)ejt dt
T
To estimate the Fourier transform of a signal, modern equipment

uses digital signal processing (DSP)
This essentially means the signal is rst sampled, and then
processed
Only a nite segment of the sample can be analyzed, xs (t)
Using this segment can be modelled as multiplying the original
signal with a nite-duration window, w(t)
This processing step is called windowing
How does this aect the estimated spectrum of the signal?
Windowing Continued Example 5: Windowing
Your oscilloscopes in the lab must estimate the CT Fourier transform
x(t) |X(j)|
of a signal using a nite segment of the data. Calculate and plot the
CT Fourier transform of a windowed sinusoid with a fundamental
t
frequency of f0 = 10 Hz for a range of window lengths. Select the
w(t) |W (j)|
sinusoidal phase and window alignment such that the signal has even
symmetry (why?).
t
w(t) x(t) 1
2 |X(j) W (j)| How does the estimated spectrum compare to the true spectrum?
What happens as the window length decreases towards zero?
t
What happens as the window length increases towards innity?
Since only of a segment of the signal is available, the Fourier What would the transform of an ideal window be?
transform of the signal cannot be calculated exactly
What are the disadvantages of using a rectangular window,
Windowing is necessary to estimate the spectrum from a segment w(t) = pT (t)?
of the signal with nite duration
In the frequency domain, this lters or blurs the spectrum
Example 10: Workspace Example 10: Window and Windowed Segment

Hint: we found the Fourier transform of a pulse earlier:
Window fo= 10.0 Hz T=0.100 s
1
1 |t| < T
p(t) = u(t + T ) u(t T ) =
Window w(t)
0.5
0 |t| > T
0
sin(T ) T
P (j) = 2T = 2T sinc 0.5
T
1
Windowed Signal y(t) = w(t) x (t)
5 4 3 2 1 0 1 2 3 4 5
s
1
0.5
0
0.5
1
5 4 3 2 1 0 1 2 3 4 5
Time (s)
Example 10: Window and Windowed Segment Transforms Example 10: Window and Windowed Segment
Pulse Spectral Amplitude fo= 10.0 Hz T=0.100 s Window fo= 10.0 Hz T=0.500 s
10 1
Window w(t)
0.5
W(j)
5 0
0.5
0
1

15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
s
1
4 0.5
Y(j)
2 0
0.5
0
1
15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
Frequency (rad/s) Time (s)
10 1
Window w(t)
0.5
W(j)
5 0
0.5
0
1
15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
s
1
4 0.5
Y(j)
2 0
0.5
0
1
15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
10 1
Window w(t)
0.5
W(j)
5 0
0.5
0
1

15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
s
1
4 0.5
Y(j)
2 0
0.5
0
1
15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
10 1
Window w(t)
0.5
W(j)
5 0
0.5
0
1
15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
s
1
4 0.5
Y(j)
2 0
0.5
0
1
15 10 5 0 5 10 15 5 4 3 2 1 0 1 2 3 4 5
Example 10: Window and Windowed Segment Transforms Example 10: MATLAB Code
Pulse Spectral Amplitude fo= 10.0 Hz T=5.000 s

10
W(j)
15 10 5 0 5 10 15
4
Y(j)
15 10 5 0 5 10 15
Frequency (rad/s)
Example 10: MATLAB Code Continued Property 11: Time & Frequency Scaling
FT
x[an] X(ej/a )
FS
x(at) X[k]

FT 1 j
x(at) X
|a| a
Scaling a signal in time inversely scales the spectrum by the same
factor
Scaling a periodic signal shifts the spacing of the harmonic
components, but the amplitudes are the same!
In the DT case, a must be an integer (the signal is not dened at
non-integer samples)
This is equivalent to sampling only 1 out of every a values of x[n]
DT periodic signals are tricky because the fundamental period of
x[an] depends on how a and N are related
Example 11: Time & Frequency Scaling Example 11: Workspace
Derive one of the transform relationships on the previous slide.
Property 12: Parsevals Theorem Example 12: Parsevals Theorem
1 2
2
Derive one of the four relationships on the previous slide.
DTFS |x[n]| = |X[k]|
N
n=<N > k=<N >

1
DTFT
2
|x[n]| = X(ej ) 2 d
n=
2 <2>

1 2 2
CTFS |x(t)| dt = |X[k]|
T <T > k=

2 1 2
CTFT |x(t)| dt = |X(j)| d
2
The energy/power of the time domain signal is equal to the

energy/power of the frequency domain transform!
Example 12: Workspace Property 12: Parsevals Theorem Comments
Thus the magnitude of the spectrum squared is called
The energy spectral density for energy (nonperiodic) signals
The power spectral density for power (periodic) signals
This is why the squared magnitude is often plotted versus
frequency instead of just the magnitude
This enables us to talk about what fraction of signal energy is
contained within certain frequency ranges
Application Example 6: Parsevals Theorem Application Example 6: Parsevals Theorem

Suppose you wish to transmit a speech signal through a channel with Linus: Philosophy of Wet Suckers
as little bandwidth as possible. 0.2
What bandwidth is necessary if you wish to retain 95% of the 0.15
signal energy?
0.1
Which frequency range should you transmit?
0.05
0
0.05
0.1
0.15
0.2
0.25
1.6 1.61 1.62 1.63 1.64 1.65 1.66 1.67 1.68 1.69
Time (sec)
Application Example 6: Parsevals Theorem Application Example 6: MATLAB Code
400
300
PSD
200
100
0
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000 5500
100
Net Spectral Energy (%)
90
80
70
60
50
40
30
20
10
0
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000 5500
Frequency (Hz)
Application Example 6: MATLAB Code Continued Property 13: Duality
FT FT
x(t) X(j) X(jt) 2x(t)
FS FS 1
x[n] X[k] X[n] x[k]
N
We have already seen many times there are equivalent
relationships between the time and frequency domain
FT FT
x(t to ) ejto X(j) ejo t x(t) X (j( o ))
FT FT
(t) 1 1 2()
FT FT
pT (t) 2T sinc( T
) 2W sinc( tW
) 2 pW ()
This occurs due to the similarity of the synthesis and analysis

equations for the CTFT and DTFS
Example 13: Duality Example 13: Workspace
Derive one of the four relationships on the previous slide.
Property 13: Duality Comments Fourier Properties Summary
FT FT All four Fourier transforms share most properties

x(t) X(j) X(jt) 2x(t)
These properties are useful for
FS FS 1
x[n] X[k] X[n] x[k] Gaining insight that helps us understand how to interpret the
N
transforms of signals (e.g. Parsevals theorem)
Gives us tools and ideas for designing systems (e.g.
It occurs for only these two transforms because only these two modulation)
have a signal and transform in the same signal class
CTFT: signal and transform are continuous and nonperiodic
DTFS: signal and transform or discrete and periodic
There is also a duality relationship between the DTFT and the
CTFS (see text for details), but this is less important
Duality is useful primarily for calculating transforms

Fourier Properties X 4

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Fourier Properties X 4

Diunggah oleh

Hak Cipta:

Format Tersedia

Overview of Fourier Representation Properties Review of Signal Types

Range of equations (nite versus innite) DT Periodic DT Fourier Series

All of the Fourier transforms are linear

Example 1: Linearity Application Example 1: Applying the Denition

Application Example 2: Workspace Property 2: Time Shift

What eect does a time shift have on even/odd symmetry in

Application Example 3: Speaker Recognition Application Example 3: Workspace

s and s is the frequency of the modulating complex sinusoid

Example 3: Frequency Shift Example 3: Workspace

Example 4: Workspace Property 4: Transform Symmetry

X[k] = X [k] X(ej ) = X (ej ) X(j) = X (j)

Each transform can be used to synthesize the signal as a sum or

Property 4: Transform Symmetry Continued Property 5: Transform Relationship to Signal Symmetry

Even signals have Fourier coecients that are real

Example 5: Workspace Property 6: Amplitude-Phase Representation

The magnitude of the Fourier coecients represents the

Example 6: Workspace Amplitude/Phase versus Real/Imaginary Plots

1.6 1.61 1.62 1.63 1.64 1.65

The most useful plot is amplitude (or squared amplitude) of the

transform versus frequency

Convolution is dened dierently for periodic and nonperiodic

Example 7: Workspace Property 7: Convolution Concepts

Convolution of periodic signals occurs in signal analysis, but not

Example 8: Workspace Property 9: Dierentiation and Integration

Example 9: Workspace Windowing

To estimate the Fourier transform of a signal, modern equipment

Example 10: Workspace Example 10: Window and Windowed Segment

Windowed Signal y(t) = w(t) x (t)

Windowed Signal y(t) = w(t) x (t)

Pulse Spectral Amplitude fo= 10.0 Hz T=5.000 s

Property 12: Parsevals Theorem Example 12: Parsevals Theorem

The energy/power of the time domain signal is equal to the

Application Example 6: Parsevals Theorem Application Example 6: Parsevals Theorem

Application Example 6: MATLAB Code Continued Property 13: Duality

This occurs due to the similarity of the synthesis and analysis

Property 13: Duality Comments Fourier Properties Summary

FT FT All four Fourier transforms share most properties

Anda mungkin juga menyukai