<s>
Reduction	B-Algorithm
of	I-Algorithm
summands	I-Algorithm
is	O
an	O
algorithm	O
for	O
fast	O
binary	O
multiplication	O
of	O
non-signed	O
binary	O
integers	O
.	O
</s>
<s>
It	O
is	O
performed	O
in	O
three	O
steps	O
:	O
production	O
of	O
summands	O
,	O
reduction	B-Algorithm
of	I-Algorithm
summands	I-Algorithm
,	O
and	O
summation	O
.	O
</s>
<s>
Given	O
enough	O
AND	O
gates	O
,	O
the	O
time	O
to	O
produce	O
the	O
summands	O
will	O
be	O
one	O
cycle	O
of	O
the	O
arithmetic	B-General_Concept
logic	I-General_Concept
unit	I-General_Concept
.	O
</s>
<s>
A	O
basic	O
full	O
adder	O
normally	O
requires	O
three	O
cycles	O
of	O
the	O
arithmetic	B-General_Concept
logic	I-General_Concept
unit	I-General_Concept
.	O
</s>
<s>
The	O
calculation	O
time	O
for	O
the	O
reduction	B-Algorithm
of	I-Algorithm
summands	I-Algorithm
algorithm	O
is	O
:	O
T	O
=	O
1Δt	O
+	O
r3Δt	O
+	O
FA	O
(	O
where	O
r	O
is	O
the	O
number	O
of	O
reduction	O
cycles	O
and	O
FA	O
is	O
the	O
time	O
for	O
the	O
fast	O
adder	O
at	O
the	O
end	O
of	O
the	O
algorithm	O
)	O
.	O
</s>
