Residue Arithmetic and VLSI

Chiang, Chao-Lin and Johnsson, Lennart (1983) Residue Arithmetic and VLSI. Technical Report. California Institute of Technology. [CaltechCSTR:1983.5092-tr-83]

Full text available as:

	Other (Adobe PDF(470KB))
	Postscript - Requires a viewer, such as GhostView

Abstract

In the residue number system arithmetic is carried out on each digit individually. There is no carry chain. This locality is of particular interest in VLSI. An evaluation of different implementations of residue arithmetic is carried out, and the effects of reduced feature sizes estimated. At the current state of technology the traditional table lookup method is preferable for a range that requires a maximum modulus that is represented by up to 4 bits, while an array of adders offers the best performance fur 7 or more bits. A combination of adders and tables covers 5 and 6 bits the best. At 0.5 mu m feature size table lookup is competitive only up to 3 bits, These conclusions are based on sample designs in nMOS.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	412
Deposited By:	Caltech Library System
Deposited On:	07 August 2002
Record Number:	CaltechCSTR:1983.5092-tr-83
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1983.5092-tr-83
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record