Algorithms for correcting carries in a carrying adder, with an example from array software
Year: 1994
Type: article
Abstract: A carrying adder is defined as a device that takes two integer n-tuples, adds corresponding positions sequentially from the right, mod some predefined radix, and transmits a 1 to be added in the next left position each time the mod operation is non-trivial. One of the two principal storage methods for arrays has the characteristic that the integer sum of two represented array points corresponds to their carrying sum. A fixed time algorithm is described for distinguishing true carries from propagated carries, and compared with other algorithms. A table lookup algorithm is described for detecting carries in the array example and its efficiency is discussed. (Author)
Source: KiltHub Repository
DOI: 10.1184/r1/6603125
Author: Zvegintzov, Nicholas
Institution: Carnegie Mellon University
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: array data structures, integer addition, Radix
Open Access status: green
OpenAlex ID: W2107940912
