<s>
Spectrum	B-Algorithm
continuation	I-Algorithm
analysis	I-Algorithm
(	O
SCA	O
)	O
is	O
a	O
generalization	O
of	O
the	O
concept	O
of	O
Fourier	O
series	O
to	O
non-periodic	O
functions	O
of	O
which	O
only	O
a	O
fragment	O
has	O
been	O
sampled	O
in	O
the	O
time	O
domain	O
.	O
</s>
<s>
Since	O
discrete	B-Algorithm
Fourier	I-Algorithm
transform	I-Algorithm
is	O
inherently	O
related	O
to	O
Fourier	O
analysis	O
,	O
this	O
type	O
of	O
spectral	O
analysis	O
is	O
by	O
definition	O
not	O
suitable	O
for	O
spectrum	O
decomposition	O
in	O
SCA	O
.	O
</s>
<s>
DFT	B-Algorithm
(	O
or	O
FFT	O
)	O
may	O
provide	O
however	O
an	O
initial	O
approximation	O
,	O
which	O
often	O
speeds	O
up	O
the	O
decomposition	O
.	O
</s>
<s>
Compared	O
to	O
DFT	B-Algorithm
(	O
or	O
FFT	O
)	O
,	O
which	O
is	O
characterized	O
by	O
perfect	O
spectral	O
resolution	O
,	O
but	O
poor	O
temporal	O
information	O
,	O
SCA	O
favours	O
temporal	O
information	O
,	O
but	O
yields	O
higher	O
spectrum	O
dispersion	O
.	O
</s>
<s>
For	O
instance	O
,	O
discrete	O
composing	O
frequency	O
resolution	O
is	O
by	O
definition	O
far	O
better	O
in	O
SCA	O
than	O
in	O
DFT	B-Algorithm
.	O
</s>
