Specific arithmetics in radices +/-4

Abstract

To accelerate binary arithmetics, algorithms in higher radices than two have been implemented. In particular, radices +or-4 present in many instances the optimum choice in terms of speed vs. complexity. In this context the author reviews Booth's algorithm for multiplication, nonrestoring redundant signed digit approaches to division and square root, and Knuth's scheme for complex arithmetic. He presents a novel way to do arithmetic on a quadtree representation of a 2-D image.<>