This paper applies the CORDIC algorithm to the Hough Transform. The CORDIC algorithm uses just adders and shifters to realize trigonometric function calculations, together with the multiplications… Expand

We introduce a redundant binary representation of the rationals and an associated algorithm for computing the sum, difference, product, quotient, and other useful functions of two rational operands, using this representation.Expand

Two algorithms for modular multiplication with very large moduli are analyzed specifically for their applicability when a high radix is used for the multiplier.Expand

The problem of digit set conversion for fixed radix is investigated for the case of converting into a non redundant, as well as into a redundant, digit set.Expand

The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a redundant representation.Expand

We develop a formal account of digit serial number representations by describing them as strings from a language. A preex of a string represents an interval approximating a number by enclosure.… Expand

We develop and compare algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings over finite precision number systems.Expand