Then the numbers are multiplied, discarding the bits beyond the eighth bit (as shown by "x"): 00000110 (6) * 11111011 (−5) ============ 110 1100 00000 110000 1100000 11000000 x10000000 + xx00000000 ============ xx11100010 This is very inefficient; by doubling the precision ahead of time, all additions must be double-precision and at least twice as many partial products are needed than for the more efficient algorithms actually implemented in computers.
Potom su brojevi pomnoženi, odbacujući bitove iza 8 (prikazanih kao 'x'): 00000110 (6) * 11111011 (−5) ============ 110 1100 00000 110000 1100000 11000000 x10000000 xx00000000 ============ xx11100010 Ovo je vrlo neefikasno; Duplirajući preciznost unapred, sva sabiranja moraju biti duple preciznosti i najmanje duplo više delimičnih proizvoda je potrebno nego za efikasnije algoritme implementirane u kompjuterima.