Asynchronous Datapaths and the Design of an Asynchronous Adder

Martin, Alain J. (1991) Asynchronous Datapaths and the Design of an Asynchronous Adder. Technical Report. California Institute of Technology. [CaltechCSTR:1991.cs-tr-91-08]

Full text available as:

Postscript - Requires a viewer, such as GhostView

Abstract

This paper presents a general method for designing delay insensitive datapath circuits. Its emphasis is on the formal derivation of a circuit from its specification. We discuss the properties required in a code that is used to transmit data asynchronously, and we introduce such a code. We introduce a general method (in the form of a theorem) for distributing the evaluation of a function over a number of concurrent cells. This method requires that the code be "distributive." We apply the method to the familiar example of a ripple-carry adder, and we give a CMOS implementation of the adder.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	86
Deposited By:	Caltech Library System
Deposited On:	25 April 2001
Record Number:	CaltechCSTR:1991.cs-tr-91-08
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1991.cs-tr-91-08
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