Optimal parameters for on-line arithmetic

Abstract

Some general techniques are given for constructing divergent examples for on-line arithmetic operations whose parameters are chosen beyond the optimal ones which converge. They are applied in particular to the cases of fully on-line multiplication, division and square root.

Keywords:

• Computer arithmetic
• multiplication
• division
• square root
• on-line algorithms
• redundant number systems
• recurrence relations