<s>
The	O
calculation	O
for	O
the	O
sliding	B-Algorithm
DFT	I-Algorithm
is	O
closely	O
related	O
to	O
Goertzel	O
algorithm	O
.	O
</s>
<s>
However	O
,	O
implementing	O
the	O
window	B-Language
function	I-Language
on	O
a	O
sliding	B-Algorithm
DFT	I-Algorithm
is	O
difficult	O
due	O
to	O
its	O
recursive	O
nature	O
,	O
therefore	O
it	O
is	O
done	O
exclusively	O
in	O
a	O
frequency	O
domain	O
.	O
</s>
<s>
It	O
is	O
not	O
possible	O
to	O
implement	O
asymmetric	O
window	B-Language
functions	I-Language
into	O
sliding	B-Algorithm
DFT	I-Algorithm
.	O
</s>
<s>
However	O
,	O
the	O
IIR	O
version	O
called	O
sliding	O
windowed	O
infinite	O
Fourier	O
transform	O
(	O
SWIFT	O
)	O
provides	O
an	O
exponential	O
window	O
and	O
the	O
αSWIFT	O
calculates	O
two	O
sDFTs	O
in	O
parallel	O
where	O
slow-decaying	O
one	O
is	O
subtracted	O
by	O
fast-decaying	O
one	O
,	O
therefore	O
a	O
window	B-Language
function	I-Language
of	O
.	O
</s>
