<s>
The	O
leading	O
and	O
trailing	O
edge-effects	O
of	O
circular	B-Algorithm
convolution	I-Algorithm
are	O
overlapped	O
and	O
added	O
,	O
and	O
subsequently	O
discarded	O
.	O
</s>
<s>
Hence	O
the	O
cost	O
of	O
the	O
overlap	B-Algorithm
–	I-Algorithm
save	I-Algorithm
method	I-Algorithm
scales	O
almost	O
as	O
while	O
the	O
cost	O
of	O
a	O
single	O
,	O
large	O
circular	B-Algorithm
convolution	I-Algorithm
is	O
almost	O
.	O
</s>
<s>
However	O
,	O
these	O
labels	O
are	O
actually	O
better	O
(	O
than	O
overlap	O
–	O
save	O
)	O
to	O
distinguish	O
from	O
overlap	B-Algorithm
–	I-Algorithm
add	I-Algorithm
,	O
because	O
both	O
methods	O
"	O
save	O
"	O
,	O
but	O
only	O
one	O
discards	O
.	O
</s>
