THE LOGICAL DESIGN OF A CLASS OF LIMITED CARRY-BORROW PROPAGATION ADDERS.
Abstract
It has been recognized for some time that one of the ways of increasing the speed of arithmetic operations in a digital computer is to introduce redundancy into the arithmetic unit, i.e. using k digital values in radix r where k > r. The purpose of this thesis is to determine the logical structure of a class of redundant adders which allow both the addend and the augend to be expressed redundantly. Rohatsch has shown that such adders must consist of three 'levels,' i.e. three transformations are necessary to map the input digit set onto the output digit set. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1968
- Accession Number
- AD0673258
Entities
People
- Richard T. Borovec
Organizations
- University of Illinois Urbana–Champaign