ALGORITHMS FOR CORRECTING CARRIES IN A CARRYING ADDER, WITH AN EXAMPLE FROM ARRAY SOFTWARE,
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1969
- Accession Number
- AD0695069
Entities
People
- Nicholas Zvegintzov
Organizations
- Carnegie Mellon University